Submission #1602811

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
using namespace std;

int main(void) {
	string s, t;
	int n;
	int count = 0;
	cin >> n >> s >> t;
	FOR(i, 0, n - 1) {
		FOR(p, 0, n-i-1) {
			if (s[i + p] != t[p]) {
				break;
			}
			if (p == n-i-1) {
				count = n + i;
				goto warp;
			}
		}
	}
	warp:
	if (count == 0) {
		cout << 2*n << endl;
	}
	else {
		cout << count << endl;
	}
	
	return 0;
}

Submission Info

Judge Result