Submission #928047

#TimeUsernameProblemLanguageResultExecution timeMemory
928047xadCOCI17_cezar (COCI17_cezar)C++17
50 / 50
1 ms612 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> #define nn "\n" #define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define intt int _; cin >> _; while (_--) #define emp push_back #define mod 1000000007 #define all(v) v.begin(), v.end() #define ld long double #define A first #define B second typedef long long ll; const ld eps = 1e-27; // diff between decimals 0.000000001 mt19937 mt(time(nullptr)); int fx[]={1,-1,0,0}, fy[]={0,0,1,-1}; int main() { /*freopen("measurement.in","r",stdin); freopen("measurement.out","w", stdout);*/ x_x int n; cin>>n; int ar[12]={}; for (int i=2; i<=11; i++) ar[i]=4; ar[10]+=12; int sm=0; for (int i=0,x; i<n;i++) cin>>x, sm+=x, ar[x]--; sm=21-sm; int z=0; for (int i=2; i<=min(11,sm); i++) z+=ar[i]; int y=52-(z+n); if(y<z)cout<<"VUCI"; else cout<<"DOSTA"; 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...