답안 #161493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161493 2019-11-02T17:27:09 Z boolodifjenula Cezar (COCI17_cezar) Python 3
50 / 50
28 ms 3428 KB
n=int(input())
m=21
K=[4,4,4,4,4,4,4,4,16,4]
for i in range(n):
    k=int(input())
    m-=k
    K[k-2]-=1
if m<=0:
    print("DOSTA")
elif sum(K[:m-1])<=sum(K[m-1:]):
    print("DOSTA")
else:
    print("VUCI")
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3428 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 26 ms 3304 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 26 ms 3332 KB Output is correct
# 결과 실행 시간 메모리 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
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3300 KB Output is correct
2 Correct 24 ms 3300 KB Output is correct
3 Correct 25 ms 3304 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3304 KB Output is correct
2 Correct 24 ms 3300 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3308 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 24 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 26 ms 3260 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 25 ms 3276 KB Output is correct
3 Correct 27 ms 3300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 3320 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 28 ms 3292 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 26 ms 3408 KB Output is correct