QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#570008 | #9308. World Cup | hinata | WA | 0ms | 1636kb | C++14 | 562b | 2024-09-17 13:13:36 | 2024-09-17 13:13:37 |
Judging History
answer
#include <cstdio>
using namespace std;
void solve() {
int x, tot = 0;
scanf("%d", &x);
for (int i = 1, y; i <= 31; ++i) {
scanf("%d", &y);
if (x > y) ++tot;
}
int ans = 1;
if (tot >= 31) ans = 1;
else if (tot >= 27) ans = 2;
else if (tot >= 13) ans = 4;
else if (tot >= 6) ans = 8;
else if (tot >= 2) ans = 16;
else ans = 32;
printf("%d\n", ans+1);
}
int main() {
// freopen("1.in", "r", stdin);
int n; scanf("%d", &n);
while (n--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 1636kb
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:
2
result:
wrong answer 1st numbers differ - expected: '1', found: '2'