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;
#define endl '\n'
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=405;
int cnt[15],a,n,sum,ans,ans1;
int main(){
//fri("in.txt");
//fro("out.txt");
for(int i=1;i<=11;i++){
cnt[i]=4;
}
cnt[10]=16;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
cnt[a]--;
sum+=a;
}
if(sum>=21)cout<<"DOSTA"<<endl;
else{
for(int i=0;i<=21-sum;i++)ans+=cnt[i];
for(int i=21-sum+1;i<=11;i++)ans1+=cnt[i];
if(ans1>ans)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... |