Submission #955008

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define pi acos(-1.0)

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;


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

    cout << n*2 << endl;
    return 0;
}

Submission Info

Judge Result