This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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] = 16;
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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |