Submission #953608

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  string s, t;
  cin >> s;
  cin >> t;

  rep(i,N+1){
    string tmp = s + t.substr(N-i,i+1);
    bool flg = true;
    rep(j,N){
      if(tmp[j] != s[j]) flg = false;
      if(tmp[tmp.size()-1-j] != t[N-1-j]) flg = false;
    }
    if(flg){
      cout << tmp.length() << endl;
      break;
    }
  }

  
  return 0;
}

Submission Info

Judge Result