이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int L[14]={0,4,4,4,4,4,4,4,4,4,4,4,4,4};
int main(){
int N,a,x,zb_iz=0,zbm=0,zbv=0;
cin >> N;
for (int i=0;i<N;i++){
cin >> a;
L[a-1]-=1;
zb_iz+=a;
}
x=21-zb_iz;
for (int i=0;i<14;i++){
if (i+1>x){
zbv+=L[i];
}
else zbm+=L[i];
}
if (zbv>=zbm) cout << "DOSTA";
else cout << "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... |