제출 #136380

#제출 시각아이디문제언어결과실행 시간메모리
136380mariusnicoliCOCI17_cezar (COCI17_cezar)C++14
50 / 50
2 ms376 KiB
#include <iostream>

using namespace std;
int f[12], n, i, x, X, s1, s2, sum;
int main () {

    for (i=2;i<=11;i++)
        f[i] = 4;
    f[10] *= 4;

    cin>>n;
    for (i=1;i<=n;i++) {
        cin>>x;
        sum += x;
        f[x] --;
    }
    X = 21-sum;

    for (i=2;i<=X;i++)
        s1 += f[i];
    for (i=X+1;i<=11;i++)
        s2 += f[i];
    if (s2 >= s1)
        cout<<"DOSTA\n";
    else
        cout<<"VUCI\n";

}
#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...