제출 #140993

#제출 시각아이디문제언어결과실행 시간메모리
140993Linca_RobertCezar (COCI17_cezar)C++14
45 / 50
2 ms504 KiB
#include<bits/stdc++.h> using namespace std; int N, f[100], s, ls, gr; int main(){ cin >> N; for( int i = 1; i <= 9; i++ ) f[i] = 4; f[10] = 12; f[11] = 4; for( int i = 1; i <= N; i++ ){ int x; cin >> x; f[x]--; s += x; } int dif = 21 - s; for( int i = 1; i <= dif; i++ ) ls += f[i]; for( int i = dif + 1; i <= 11; i++ ) gr += f[i]; if( gr >= ls ) cout << "DOSTA\n"; else cout << "VUCI\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...