Submission #19391698
Source Code Expand
Copy
S=input() L=len(S) ans=[] while L>=0: now=S+S[:L][::-1] if now==now[::-1]: ans.append(L) L-=1 print(min(ans))
Submission Info
Submission Time | |
---|---|
Task | B - Concatenated Palindrome |
User | zentsu999 |
Language | Python (3.8.2) |
Score | 200 |
Code Size | 137 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 9004 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 25 ms | 8816 KB |
sample_02.txt | AC | 24 ms | 8880 KB |
sample_03.txt | AC | 17 ms | 8912 KB |
sample_04.txt | AC | 18 ms | 8928 KB |
subtask_1_1.txt | AC | 21 ms | 9000 KB |
subtask_1_10.txt | AC | 21 ms | 8808 KB |
subtask_1_11.txt | AC | 18 ms | 8792 KB |
subtask_1_12.txt | AC | 26 ms | 8804 KB |
subtask_1_13.txt | AC | 20 ms | 8812 KB |
subtask_1_14.txt | AC | 18 ms | 8804 KB |
subtask_1_2.txt | AC | 23 ms | 8808 KB |
subtask_1_3.txt | AC | 18 ms | 8928 KB |
subtask_1_4.txt | AC | 17 ms | 9000 KB |
subtask_1_5.txt | AC | 19 ms | 8916 KB |
subtask_1_6.txt | AC | 16 ms | 9000 KB |
subtask_1_7.txt | AC | 17 ms | 8904 KB |
subtask_1_8.txt | AC | 17 ms | 8948 KB |
subtask_1_9.txt | AC | 19 ms | 9004 KB |