이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
int n;
int cnt[12]={0,0,4,4,4,4,4,4,4,4,16,4};
int x=21;
int main(){
cin>>n;
for(int i=0;i<n;i++){
int y;
cin>>y;
cnt[y]--;
x-=y;
}
x=min(x,11),x=max(x,2);
int l=0,r=0;
for(int i=2;i<=x;i++)l+=cnt[i];
for(int i=x+1;i<12;i++)r+=cnt[i];
if(r>=l)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... |