Submission #929060

#TimeUsernameProblemLanguageResultExecution timeMemory
929060sondos225COCI17_cezar (COCI17_cezar)C++17
35 / 50
1 ms600 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL); #define pb push_back #define yes "YES" #define no "NO" #define bigg INT_MAX #define debug(x) cout<<(#x)<<" = " <<x<<endl; #define all(x) x.begin(),x.end() #define sz size() #define nn '\n' #define mms(x,y) memset(x,y,sizeof(x)) #define forr(i,j,n) for (int i=j; i<n; i++) #define forn(i,j,n) for (int i=j; i>n; i--) #define fi first #define se second #define la "LA" #define cinn(x,y) for(int i=0; i<y; i++) cin>>x[i]; #define pii pair<int,int> signed main() { // #ifndef LOCAL // freopen("helpcross.in","r",stdin); // freopen("helpcross.out","w", stdout); // #endif fast int n; cin>>n; int a[12]; forr(i,1,10) a[i]=4; a[10]=16; a[11]=4; int x; int sm=0; forr(i,0,n) { cin>>x; sm+=x; a[x]--; } int df=21-sm; int c1=0, c2=0; forr(i,1,df+1) { c1+=a[i]; } forr(i,df+1,12) { c2+=a[i]; } //cout<<c1<<' '<<c2<<endl; if (c1<=c2) cout<<"DOSTA"; else cout<<"VUCI"; 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...