Submission #6487931

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
using namespace std;

int main(){

    int n; cin >> n;

    string s, t; cin >> s >> t;

    int n_overlap = n;
    while(s.size() != 0){
        if(s == t){
            break;
        }
        else{
            n_overlap -= 1;
            s.erase(s.begin());
            t.pop_back();
        }
    }

    cout << 2*(n-n_overlap) + n_overlap << endl;

    return 0;
}

Submission Info

Judge Result