제출 #61635

#제출 시각아이디문제언어결과실행 시간메모리
61635win11905Cezar (COCI17_cezar)C++11
35 / 50
4 ms864 KiB
#include <bits/stdc++.h>
using namespace std;

int cnt[105];

int main() {
    fill_n(cnt, 105, 4);
    int z = 21;
    int n; cin >> n;
    for(int i = 1; i <= n; ++i) {
        int ret; cin >> ret;
        z -= ret;
        cnt[ret]--;
    }
    int c1 = 0, c2 = 0;
    for(int i = 1; i <= z; ++i) c1 += cnt[i];
    for(int i = z+1; i <= 11; ++i) c2 += cnt[i];
    puts(c1 > c2 ? "VUCI" : "DOSTA");
}
#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...