제출 #141539

#제출 시각아이디문제언어결과실행 시간메모리
141539radugheoCezar (COCI17_cezar)C++14
30 / 50
2 ms452 KiB
#include <iostream> using namespace std; int n, i, x, mana, dif, nr1, nr2; int f[12]; int main(){ for (i=1; i<=11; i++){ f[i] = 4; } f[10] = 16; cin >> n; for (i=1; i<=n; i++){ cin >> x; if (x == 12 || x == 13 || x == 14){ f[10]--; } else{ f[x]--; } mana += x; } dif = 21 - mana; for (i=1; i<=11; i++){ if (dif <= i){ nr1 += f[i]; } else{ nr2 += f[i]; } } if (nr1 >= nr2){ 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...