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>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
typedef long double ld;
using namespace std;
int main()
{
int ara[12] = {0, 0, 4, 4, 4, 4, 4, 4, 4, 4, 16, 4};
int n, d, sum = 0;
int i, big = 0, smol = 0;
cin >> n;
for(int i = 0; i < n; i++) {
int x;
cin >> x; sum += x;
ara[x]--;
}
d = 21-sum;
for(i = d; i < 12; i++) big += ara[i];
for(i = 0; i <= d; i++) smol += ara[i];
if(big >= smol) puts("DOSTA");
else puts("VUCI");
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... |