Submission #38060955

Source Code Expand

#ABC285_B_20230115
N=int(input())
S=input()
for i in range(1,N):
    ans=0
    for j in range(N-i):
        #print(S[j],S[j+i])
        if(S[j]==S[j+i]):
            break
        else:
            ans+=1
    print(ans)

Submission Info

Submission Time
Task B - Longest Uncommon Prefix
User Konini
Language PyPy3 (7.3.0)
Score 200
Code Size 232 Byte
Status AC
Exec Time 133 ms
Memory 74424 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 1
AC × 20
Set Name Test Cases
Sample sample_01.txt
All sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 107 ms 61596 KiB
test_01.txt AC 49 ms 61444 KiB
test_02.txt AC 48 ms 61720 KiB
test_03.txt AC 42 ms 61440 KiB
test_04.txt AC 53 ms 61512 KiB
test_05.txt AC 45 ms 61660 KiB
test_06.txt AC 49 ms 61424 KiB
test_07.txt AC 48 ms 61468 KiB
test_08.txt AC 77 ms 74052 KiB
test_09.txt AC 74 ms 74424 KiB
test_10.txt AC 133 ms 73960 KiB
test_11.txt AC 129 ms 74020 KiB
test_12.txt AC 49 ms 61676 KiB
test_13.txt AC 47 ms 61784 KiB
test_14.txt AC 50 ms 61668 KiB
test_15.txt AC 68 ms 73596 KiB
test_16.txt AC 69 ms 73748 KiB
test_17.txt AC 69 ms 73860 KiB
test_18.txt AC 71 ms 73808 KiB
test_19.txt AC 73 ms 73832 KiB