Submission #1408079

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const llint mod=1000000007;
const llint big=1e17-10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int main(void){
	int i,j,n;cin>>n;
	string s,t;cin>>s>>t;
	string ans;
	for(i=0;i<=n;i++){
		int ok=0;
		for(j=0;i+j<n;j++){if(s[i+j]!=t[j]){ok=1;break;}}
		if(ok==1){continue;}
		for(j=0;j<n;j++){cout<<s[j];}
		for(j=n-i;j<n;j++){cout<<t[j];}
		break;
	}
	cout<<endl;
	return 0;
}

Submission Info

Judge Result