Submission #163771

#TimeUsernameProblemLanguageResultExecution timeMemory
163771sochoCezar (COCI17_cezar)C++14
50 / 50
2 ms396 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {

    int n;
    cin >> n;
    int sf = 0;
    int arr[n];
    int f[12];
    for (int i=0; i<10; i++) {
        f[i] = 4;
    }
    f[0] = 0;
    f[1] = 0;
    f[10] = 12;
    f[11] = 4;
    for (int i=0; i<n; i++) {
        cin >> arr[i];
        sf += arr[i];
        f[arr[i]]--;
    }
    int d = 21 - sf;
    int b = 0;
    int c = 0;
    for (int i=0; i<=d; i++) {
        if (i <= 11) {
            b += f[i];
        }
    }
    for (int i=max(d+1,0); i<=11; i++) {
        c += f[i];
    }
    //cout << b << " " << c << endl;
    if (b <= c) {
        cout << "DOSTA";
    }
    else {
        cout << "VUCI";
    }

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