Submission #66941521

Source Code Expand

n = int(input())
a = list(map(int,input().split()))
now = 0
for i in range(n-1):
    s = []
    now = 0
    for k in range(n-i-1):
        now += a[k+i]
        s.append(now)
    print(*s)

Submission Info

Submission Time
Task B - Distance Table
User Tree_Three
Language Python (PyPy 3.10-v7.3.12)
Score 200
Code Size 199 Byte
Status AC
Exec Time 65 ms
Memory 82088 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 17
Set Name Test Cases
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt
Case Name Status Exec Time Memory
example_00.txt AC 56 ms 76456 KiB
example_01.txt AC 56 ms 76448 KiB
hand_00.txt AC 65 ms 82088 KiB
hand_01.txt AC 57 ms 76408 KiB
hand_02.txt AC 65 ms 82012 KiB
hand_03.txt AC 56 ms 76312 KiB
hand_04.txt AC 63 ms 81908 KiB
random_00.txt AC 60 ms 80852 KiB
random_01.txt AC 60 ms 80608 KiB
random_02.txt AC 63 ms 81868 KiB
random_03.txt AC 60 ms 80552 KiB
random_04.txt AC 60 ms 80564 KiB
random_05.txt AC 59 ms 80516 KiB
random_06.txt AC 59 ms 80628 KiB
random_07.txt AC 61 ms 81148 KiB
random_08.txt AC 59 ms 80548 KiB
random_09.txt AC 60 ms 81248 KiB