이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
int N, f[100], s, ls, gr;
int main(){
cin >> N;
for( int i = 1; i <= 9; i++ )
f[i] = 4;
f[10] = 12;
f[11] = 4;
for( int i = 1; i <= N; i++ ){
int x; cin >> x;
f[x]--;
s += x;
}
int dif = 21 - s;
for( int i = 1; i <= dif; i++ )
ls += f[i];
for( int i = dif + 1; i <= 11; i++ )
gr += f[i];
if( gr >= ls )
cout << "DOSTA\n";
else
cout << "VUCI\n";
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... |