Submission #237198

#TimeUsernameProblemLanguageResultExecution timeMemory
237198DIvanCodeCOCI17_cezar (COCI17_cezar)C++14
30 / 50
5 ms384 KiB
#include<iostream> #include<cstdio> #include<cstdlib> #include<algorithm> #include<cmath> #include<vector> #include<set> #include<map> #include<unordered_set> #include<unordered_map> #include<queue> #include<ctime> #include<cassert> #include<complex> #include<string> #include<cstring> #include<chrono> #include<random> #include<bitset> #include<iomanip> #define fi first #define se second #define mp make_pair #define eb emplace_back #define all(v) v.begin(), v.end() #define sz(v) (int) v.size() using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef pair<int, int> pii; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> cnt(12, 4); cnt[10] = 12; int sum = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; sum += x; cnt[x]--; } int diff = 21 - sum, sum1 = 0, sum2 = 0; for (int i = 0; i <= min(11, diff); ++i) { sum1 += cnt[i] * i; } for (int i = diff + 1; i < 12; ++i) { sum2 += cnt[i] * i; } if (sum1 <= sum2) { cout << "DOSTA\n"; } else { cout << "VUCI\n"; } 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...