Submission #161440

#	Time	Username	Problem	Language	Result	Execution time	Memory
161440		boolodifjenula	COCI17_cezar (COCI17_cezar)	Cpython 3	35 / 50	28 ms	3428 KiB

cezar

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")
    

• Subtask 1: 0 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 0 / 5
• Subtask 10: 5 / 5