Submission #1450738
Source Code Expand
N = int(input()) prefix = input() suffix = input() if len(prefix) + len(suffix) < N: d = N - len(prefix) + len(suffix) print(len(prefix + 'a' * d + suffix)) else: s = "" for i in range(1, N): # print(prefix[-i:], suffix[:i]) if prefix[-i:] == suffix[:i]: s = prefix[:-i] + suffix if suffix == prefix: s = suffix if len(s) == 0: s = prefix + suffix print(len(s))
Submission Info
Submission Time | |
---|---|
Task | A - Prefix and Suffix |
User | lol |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 457 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 | 3060 KB |
0_01.txt | AC | 17 ms | 3060 KB |
0_02.txt | AC | 17 ms | 3060 KB |
1_00.txt | AC | 17 ms | 3060 KB |
1_01.txt | AC | 17 ms | 3060 KB |
1_02.txt | AC | 17 ms | 3060 KB |
1_03.txt | AC | 17 ms | 3060 KB |
1_04.txt | AC | 17 ms | 3060 KB |
1_05.txt | AC | 17 ms | 3060 KB |