Submission #1369654


Source Code Expand

import sys
N=int(input())
A=list(map(int,input().split()))
total=0
for i in range(N):
  total+=A[i]
if total*2/((N+1)*N)%1!=0:
  print("NO")
  sys.exit()
times=int(total*2/((N+1)*N))
if (times-A[0]+A[N-1])/N%1!=0:
  print("NO")
  sys.exit()
B=(times-A[0]+A[N-1])/N
for i in range(N-1):
  B+=(times-A[i+1]+A[i])/N
  if (times-A[i+1]+A[i])/N%1!=0:
    print("NO")
    sys.exit()
if B==times:
  print("YES")
else:
  print("NO")

Submission Info

Submission Time
Task A - Addition
User wkb89_
Language Python (3.4.3)
Score 0
Code Size 446 Byte
Status WA
Exec Time 61 ms
Memory 14360 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 1
WA × 1
AC × 8
WA × 8
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt WA 59 ms 14104 KB
in10.txt WA 57 ms 14104 KB
in11.txt WA 17 ms 3064 KB
in12.txt AC 17 ms 3064 KB
in2.txt WA 58 ms 14100 KB
in3.txt WA 60 ms 14104 KB
in4.txt AC 61 ms 14360 KB
in5.txt AC 59 ms 14104 KB
in6.txt AC 60 ms 14100 KB
in7.txt AC 59 ms 14104 KB
in8.txt AC 58 ms 14360 KB
in9.txt WA 59 ms 14104 KB
sample1.txt AC 17 ms 3064 KB
sample2.txt WA 17 ms 3064 KB