제출 #234376

#제출 시각아이디문제언어결과실행 시간메모리
234376NONAMECezar (COCI17_cezar)C++17
50 / 50
5 ms384 KiB
#include <bits/stdc++.h> #define all(x) x.begin(), x.end() #define sz(x) int(x.size()) #define in(x) freopen(x, "r", stdin) #define out(x) freopen(x, "w", stdout) #define N 100500 #define oo ll(1e16) #define ft first #define sd second #define mp make_pair #define pb push_back #define ppb pop_back #define el '\n' #define elf endl #define base ll(1e9 + 7) using namespace std; typedef long long ll; typedef long double ld; int cnt[20], q, sum, cnt1, cnt2; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (int i = 2; i <= 9; i++) cnt[i] = 4; cnt[10] = 12; cnt[11] = 4; cin >> q; while (q--) { int z; cin >> z; sum += z; cnt[z]--; } int x = 21 - sum; for (int i = 2; i <= 11; i++) { if (i <= x) cnt1 += cnt[i]; if (i > x) cnt2 += cnt[i]; } if (cnt2 >= cnt1) 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...