QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#573362 | #9308. World Cup | ILACHOUCHOU | RE | 0ms | 0kb | C++17 | 604b | 2024-09-18 18:22:29 | 2024-09-18 18:22:29 |
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
void solve(){
int ch = 0;
int a[33];
for(int i = 1;i <= 32; i++) cin >> a[i];
ch = a[1];
sort(a + 1, a + 33);
for(int i = 1;i <= 33; i++){
if(a[i] == ch){
if(i <= 2) cout << 32 << endl;
else if(i <= 6) cout << 16 << endl;
else if(i <= 14) cout << 8 << endl;
else if(i <= 27) cout << 4 << endl;
else if(i <= 31) cout << 2 << endl;
else cout << 1 << endl;
}
}
}
signed main(){
int t;
cin >> t;
while(t--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
input:
1 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1