Submission #3262151

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = 1e9;
const ll LLINF = 1e18;

int main()
{
  string s, t;
  cin >> s >> t;
  int n = s.size() + t.size();
  for (int i = 0, j = 0, k = 0; i < n; ++i) {
    char ch = i % 2 == 0 ? s[j++] : t[k++];
    printf("%c", ch);
  }
  printf("\n");
  return 0;
}

Submission Info

Judge Result