Submission #6432863

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr<<#x<<": "<<x<<endl


int main(){
    int n;
    string s, t;
    cin >> n;
    cin >> s;
    cin >> t;

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

Submission Info

Judge Result