Submission #161452

# Submission time Handle Problem Language Result Execution time Memory
161452 2019-11-02T15:27:21 Z boolodifjenula COCI17_cezar (COCI17_cezar) Python 3
35 / 50
47 ms 3428 KB
n=int(input())
S=0
L=[]
K=[4,4,4,4,4,4,4,4,16,4]
for i in range(n):
    L+=[int(input())]
    S+=L[i]
    K[L[i]-2]-=1
m=21-sum(L)
if sum(K[:m+1])<=sum(K[m+1:]):
    print("DOSTA")
else:
    print("VUCI")
# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 3292 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 26 ms 3428 KB Output is correct
2 Correct 26 ms 3332 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 26 ms 3392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 3300 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 26 ms 3420 KB Output is correct
3 Correct 27 ms 3340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 3272 KB Output is correct
2 Correct 47 ms 3272 KB Output is correct
3 Correct 26 ms 3292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 46 ms 3428 KB Output is correct
2 Correct 30 ms 3428 KB Output is correct
3 Correct 26 ms 3300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 3300 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 28 ms 3388 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 25 ms 3292 KB Output is correct