# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
472717 | MamdouhN | Cezar (COCI17_cezar) | C++14 | 1 ms | 268 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
vector<int>allcards;
main()
{
for(int i=2;i<=14;i++)
{
int x = i;
if(i>11) x =10;
allcards.push_back(x);
allcards.push_back(x);
allcards.push_back(x);
allcards.push_back(x);
}
int deck = 52;
//cout<<allcards.size()<<endl;
//for(auto v:allcards)cout<<v<<" ";
//cout<<endl;
sort(allcards.begin(),allcards.end());
int n;
cin>>n;
int sum = 0;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
for(int i=0;i<allcards.size();i++)
if(allcards[i]==x)
{
allcards[i]=0;
break;
}
deck--;
sum+=x;
}
sum = 21-sum;
int greate=0;
for(int i=0;i<allcards.size();i++)if(allcards[i]>sum)greate++;
if(greate>=deck-greate)cout<<"DOSTA"<<endl;
else cout<<"VUCI"<<endl;
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |