Submission #71509844

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
count = 0
for l in range(n):
    for r in range(l, n):
        ssum = sum(a[l : r + 1])
        ok = True
        for i in range(l, r + 1):
            if ssum % a[i] == 0:
                ok = False
                break
        if ok:
            count += 1
print(count)

Submission Info

Submission Time
Task B - No-Divisible Range
User AKI24957
Language Python (CPython 3.13.7)
Score 200
Code Size 340 Byte
Status AC
Exec Time 12 ms
Memory 9200 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 25
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, hand_05.txt, hand_06.txt, hand_07.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, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt
Case Name Status Exec Time Memory
example_00.txt AC 10 ms 9200 KiB
example_01.txt AC 10 ms 9100 KiB
hand_00.txt AC 10 ms 9048 KiB
hand_01.txt AC 11 ms 9192 KiB
hand_02.txt AC 11 ms 9192 KiB
hand_03.txt AC 11 ms 9000 KiB
hand_04.txt AC 12 ms 9160 KiB
hand_05.txt AC 10 ms 9120 KiB
hand_06.txt AC 10 ms 9152 KiB
hand_07.txt AC 11 ms 9176 KiB
random_00.txt AC 11 ms 9000 KiB
random_01.txt AC 11 ms 9068 KiB
random_02.txt AC 10 ms 9152 KiB
random_03.txt AC 11 ms 9100 KiB
random_04.txt AC 11 ms 9068 KiB
random_05.txt AC 11 ms 9036 KiB
random_06.txt AC 11 ms 9036 KiB
random_07.txt AC 12 ms 9148 KiB
random_08.txt AC 11 ms 9140 KiB
random_09.txt AC 11 ms 9148 KiB
random_10.txt AC 11 ms 9072 KiB
random_11.txt AC 11 ms 9048 KiB
random_12.txt AC 11 ms 9100 KiB
random_13.txt AC 11 ms 9160 KiB
random_14.txt AC 11 ms 9200 KiB