QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#568225 | #9308. World Cup | Departagain | WA | 1ms | 3744kb | C++14 | 447b | 2024-09-16 15:38:47 | 2024-09-16 15:38:49 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
cin>>T;
while(T--)
{
int arr[33];
for(int i=0;i<32;i++) scanf("%d",&arr[i]);
int cn=arr[0];
sort(arr,arr+32);
for(int i=0;i<32;i++) if(cn==arr[i]) cn=i+1;
if(cn==1) printf("1\n");
else if(cn<=2&&cn>=17)printf("2\n");
else if(cn==18)printf("4\n");
else if(cn>=19&&cn<=26)printf("8\n");
else if(cn<=27&&cn>=30)printf("16\n");
else printf("32\n");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3744kb
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:
32
result:
wrong answer 1st numbers differ - expected: '1', found: '32'