QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#567814 | #9308. World Cup | Darkmaster | WA | 1ms | 3672kb | C++14 | 576b | 2024-09-16 14:04:06 | 2024-09-16 14:04:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n, a[40];
void solve(){
int lw = 0, rk;
n = 32;
for(int i = 1; i <= n; i ++){
cin >> a[i];
if(a[i] > a[1]) lw ++;
}
rk = n - lw;
// cout << rk << '\n';
if(rk == 1) cout << 1 << '\n';
else if(rk == 2) cout << 2 << '\n';
else if(rk >= 35) cout << 32 << '\n';
else if(rk <= 18) cout << 4 << '\n';
else if(rk <= 26) cout << 8 << '\n';
else cout << 16 << '\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3672kb
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
output:
16
result:
wrong answer 1st numbers differ - expected: '1', found: '16'