蓝桥算法训练 字符串合并 ALGO-233

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

#define INF 0x7fffffff
const double inf=1e20;
const int maxn=1000+10;
const int mod=1e7;
const double pi=acos(-1);

char a[maxn],b[maxn];

int main(){
    scanf("%s%s",a,b);
    printf("%s%s\n",a,b);
    return 0;
}