Submission #953972

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
// #define int long long
#define first first
#define second se
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;

signed main(){
    int n;
    string s, t;
    cin >> n >> s >> t;
    int l = min(s.size(), t.size());
    int c = 0;
    rep(i, 0, l + 1){
        bool f = true;
        rep(j, 0, i){
            if(t[j] != s[s.size() - i + j]){
                f = false;
            }
        }
        if(f) c = max(c, i);
    }
    int ans = max(n, (int)s.size() + (int)t.size() - c);
    o(ans);
}

Submission Info

Judge Result