Submission #1570667
Source Code Expand
N = int(input()) s = input() t = input() if s == t: print(len(s)) else: ans = N * 2 for i in range(N): a = s[:i] + t if a[:N] == s: ans = min(ans, len(a)) a = s + t[i:] if a[N:] == t: ans = min(ans, len(a)) print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - Prefix and Suffix |
User | odan |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 313 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 17 ms | 2940 KB |
0_01.txt | AC | 17 ms | 3060 KB |
0_02.txt | AC | 17 ms | 2940 KB |
1_00.txt | AC | 17 ms | 3060 KB |
1_01.txt | AC | 17 ms | 2940 KB |
1_02.txt | AC | 17 ms | 3060 KB |
1_03.txt | AC | 17 ms | 2940 KB |
1_04.txt | AC | 17 ms | 2940 KB |
1_05.txt | AC | 17 ms | 3060 KB |