Submission #6494830

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;

signed main(){
    int n;
    cin >> n;
    string s,t;
    cin >> s >> t;
    for(int i = n; i >= 0; i--){
        if(s.substr(n - i) == t.substr(0, i)){
            cout << 2 * n - i << endl;
            break;
        }
    }
}

Submission Info

Judge Result