-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1238.cpp
47 lines (44 loc) · 1.01 KB
/
1238.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef vector<string> vs;
typedef vector<int> vi;
typedef set<char> sc;
typedef pair<int, int> pii;
#define mp make_pair
#define pb push_back
#define pi 3.1415926535897932384626433832795
#define MOD 1000000007
#define For(n) for(int i=0; i<n; i++)
#define Revl(n) for(int i=n; i>=0; i--)
#define FOR(p,k) for(int i=p; i<k; i++)
#define Sort(x) sort(x.begin(), x.end())
#define Revs(x) reverse(s.begin(), x.end())
#define mem(a,b) memset(a, b, sizeof(a))
#define two(i) ((ll)1<<i)
int main()
{
int t;
cin>>t;
while(t--)
{
string a, b;
cin>>a>>b;
string big;
int aa = a.size(), bb=b.size();
(aa>bb) ? big=a : big=b;
int mi = min(aa, bb);
For(mi)
{
cout<<a[i]<<b[i];
}
if(aa!=bb)
FOR(mi,big.size())
{
cout<<big[i];
}
cout<<endl;
}
return 0;
}