답안 #161477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161477 2019-11-02T16:44:32 Z boolodifjenula Cezar (COCI17_cezar) Python 3
45 / 50
47 ms 3400 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-S
if sum(K[:m])<=sum(K[m:]):
    print("DOSTA")
else:
    print("VUCI")
    

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 3368 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 26 ms 3380 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3300 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 27 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 3300 KB Output is correct
2 Correct 29 ms 3396 KB Output is correct
3 Correct 29 ms 3288 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3344 KB Output is correct
2 Correct 27 ms 3300 KB Output is correct
3 Correct 26 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3304 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 26 ms 3324 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 3304 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 24 ms 3300 KB Output is correct
3 Correct 25 ms 3364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3372 KB Output is correct
2 Correct 47 ms 3324 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 3300 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3400 KB Output is correct
2 Correct 26 ms 3340 KB Output is correct
3 Correct 26 ms 3272 KB Output is correct