Submission #1310501

#TimeUsernameProblemLanguageResultExecution timeMemory
1310501dgarcia09Cezar (COCI17_cezar)C++20
5 / 50
1 ms576 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("O2") #define int long long #define endl '\n' #define fr first #define sc second #define vc vector<int> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.precision(0); int n; cin >> n; vc num(n); vc res(15, 4); int sum = 0; for(int i = 1; i <= n; i++){ cin >> num[i]; res[num[i]]--; sum += num[i]; } sum = abs(sum - 21); int cont1 = 0, cont2 = res[1]; for(int i = 2; i <= sum; i++){ cont1 += res[i]; } for (int i = sum+1; i <= 14; i++){ cont2 += res[i]; } if(cont2 >= cont1){ cout << "DOSTA" << endl; }else{ cout << "VUCI" << endl; } 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...