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