Submission #155203

#TimeUsernameProblemLanguageResultExecution timeMemory
155203GoldNextYearCOCI17_cezar (COCI17_cezar)C++14
45 / 50
3 ms380 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 340 #define mid (l+r)/2 #define pb push_back #define pob pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1000000007; const ll inf=1e18*4; const ld pai=acos(-1); int n,sum; int arr[12]; int main(){ for(int i=2;i<=11;i++)arr[i]=4; arr[10]=12; cin>>n; for(int i=0;i<n;i++){ int x;cin>>x; arr[x]--; sum+=x; } int xxx=21-sum; int all=52-n; int num=0; for(int i=xxx+1;i<=11;i++){ num+=arr[i]; } if(num>=(all-num))cout<<"DOSTA"<<endl; else cout<<"VUCI"<<endl; }
#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...