이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
vector<int> cnt(15, 0);
for(int i = 2; i <= 9; i++) {
cnt[i] = 4;
}
cnt[10] = 4 * 4;
cnt[11] = 4;
int N, sum = 0;
cin >> N;
while(N--) {
int card;
cin >> card;
cnt[card]--;
sum += card;
}
int diff = 21 - sum, greater = 0, less = 0;
for(int i = 2; i <= 11; i++) {
if (i > diff) {
greater += cnt[i];
} else {
less += cnt[i];
}
}
if (greater >= less) {
cout << "DOSTA\n";
} else {
cout << "VUCI\n";
}
return 0;
}
//~ check for overflows
# | 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... |