제출 #166298

#제출 시각아이디문제언어결과실행 시간메모리
166298itiamCezar (COCI17_cezar)C++11
50 / 50
2 ms452 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...