제출 #165772

#제출 시각아이디문제언어결과실행 시간메모리
165772muhi1112Cezar (COCI17_cezar)C++17
35 / 50
5 ms404 KiB
#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;
	}
	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 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...