Submission #83960

#TimeUsernameProblemLanguageResultExecution timeMemory
83960josiftepeCOCI17_cezar (COCI17_cezar)C++14
30 / 50
2 ms636 KiB
#include <iostream> #include <cstring> #include <vector> #include <set> #include <map> #include <sstream> #include <cstdio> #include <algorithm> #include <stack> #include <queue> #include <cmath> #include <iomanip> #include <fstream> //#include <bits/stdc++.h> using namespace std; typedef long long ll; const int INF = (1 << 30); const ll inf = (1LL << 60LL); const int maxn = 1e5 + 10; int n; int arr[55]; int cnt[20]; int main(int argc, const char * argv[]) { ios_base::sync_with_stdio(false); // ifstream cin("in.txt"); cin >> n; int sum = 0; for(int i = 0; i < n; i ++){ cin >> arr[i]; sum += arr[i]; } for(int i = 2; i <= 9; i ++){ cnt[i] = 4; } cnt[10] = 16; cnt[11] = 4; for(int i = 0; i< n; i ++){ cnt[arr[i]] --; } int X = 21 - sum; int ret =0 ; for(int i = 2; i <= 11; i ++){ if(i > X){ ret += cnt[i]; } } if(ret > X){ 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...