Submission #1972152
Source Code Expand
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <numeric>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
/*************** using variables ***************/
string o;
string e;
/**********************************************/
int main(){
cin >> o >> e;
REP(i, e.size()){
cout << o[i] << e[i];
}
if(o.size() - e.size() == 1){
cout << o[o.size()-1];
}
cout << endl;
}
Submission Info
Submission Time |
|
Task |
B - ∵∴∵ |
User |
wheson |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1141 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt |
All |
0_000.txt, 0_001.txt, rnd0.txt, rnd1.txt, rnd2.txt, rnd3.txt, short1.txt, short2.txt, short3.txt, wf.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
1 ms |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
rnd0.txt |
AC |
1 ms |
256 KB |
rnd1.txt |
AC |
1 ms |
256 KB |
rnd2.txt |
AC |
1 ms |
256 KB |
rnd3.txt |
AC |
1 ms |
256 KB |
short1.txt |
AC |
1 ms |
256 KB |
short2.txt |
AC |
1 ms |
256 KB |
short3.txt |
AC |
1 ms |
256 KB |
wf.txt |
AC |
1 ms |
256 KB |