Submission #21802014

Source Code Expand

# input
N = int(input())
A = list(map(int, input().split()))
A.sort()

# calculate Q
Q = [0 for i in range(N)]
Q[0] = A[0]
for i in range(1, N):
    Q[i] = A[i] - A[i - 1]

# calculate the answer
Answer = 1
for i in range(N):
    Answer *= (Q[i] + 1)
    Answer %= 1000000007

# output
print(Answer)

Submission Info

Submission Time
Task B - ARC Wrecker
User E869120
Language Python (3.8.2)
Score 400
Code Size 319 Byte
Status AC
Exec Time 113 ms
Memory 20588 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
in01.txt AC 22 ms 8864 KiB
in02.txt AC 21 ms 8804 KiB
in03.txt AC 18 ms 8864 KiB
in04.txt AC 19 ms 9040 KiB
in05.txt AC 21 ms 8976 KiB
in06.txt AC 20 ms 8960 KiB
in07.txt AC 78 ms 10328 KiB
in08.txt AC 76 ms 10456 KiB
in09.txt AC 80 ms 11272 KiB
in10.txt AC 108 ms 19500 KiB
in11.txt AC 109 ms 19848 KiB
in12.txt AC 112 ms 19744 KiB
in13.txt AC 113 ms 19888 KiB
in14.txt AC 86 ms 20588 KiB
in15.txt AC 89 ms 19844 KiB
in16.txt AC 86 ms 19892 KiB
in17.txt AC 17 ms 8908 KiB
in18.txt AC 22 ms 8784 KiB
in19.txt AC 83 ms 20308 KiB
sample_01.txt AC 20 ms 8876 KiB
sample_02.txt AC 20 ms 8912 KiB
sample_03.txt AC 18 ms 8784 KiB