Submission #3025247


Source Code Expand

S = input()

def check_kaibun(x):
  if len(x) == 1:
    return True
  
  head = 0
  tail = len(x) - 1
  while head < tail:
    if x[head] != x[tail]:
      return False
    head += 1
    tail -= 1
  return True  

for i in range(len(S)):
  if check_kaibun(S[i:]):
    print(i)
    exit()

Submission Info

Submission Time
Task B - Concatenated Palindrome
User kj1321
Language Python (3.4.3)
Score 200
Code Size 305 Byte
Status AC
Exec Time 17 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 18
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 17 ms 2940 KB
sample_02.txt AC 17 ms 3060 KB
sample_03.txt AC 17 ms 2940 KB
sample_04.txt AC 17 ms 3060 KB
subtask_1_1.txt AC 17 ms 2940 KB
subtask_1_10.txt AC 17 ms 2940 KB
subtask_1_11.txt AC 17 ms 2940 KB
subtask_1_12.txt AC 17 ms 3060 KB
subtask_1_13.txt AC 17 ms 3060 KB
subtask_1_14.txt AC 17 ms 3060 KB
subtask_1_2.txt AC 17 ms 2940 KB
subtask_1_3.txt AC 17 ms 3060 KB
subtask_1_4.txt AC 17 ms 2940 KB
subtask_1_5.txt AC 17 ms 2940 KB
subtask_1_6.txt AC 17 ms 3060 KB
subtask_1_7.txt AC 17 ms 2940 KB
subtask_1_8.txt AC 17 ms 3060 KB
subtask_1_9.txt AC 17 ms 3060 KB