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 main(){
int n, m, my = 0, vis[30], s1 = 0, s2 = 0;
string s;
for (int i = 1; i <= 11; i++) {
vis[i] = 4;
}
vis[10] = 16;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> m;
my += m;
vis[m]--;
}
my = 21 - my;
if (my >= 11) {
printf("VUCI");
return 0;
}
for (int i = 1; i <= 11; i++){
if (i <= my)
s1 += vis[i];
else
s2 += vis[i];
}
if (s2 >= s1) {
cout << "DOSTA" << endl;
} else {
cout << "VUCI" << endl;
}
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... |