QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #571314 | #9320. Find the Easiest Problem | wangwx | WA | 0ms | 3576kb | C++14 | 597b | 2024-09-17 21:58:46 | 2024-09-17 21:58:47 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int mxn=1e5+7;
int val,T,i,a[40];
signed main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin >> T;
while(T--){
for(i=1;i<=32;i++)cin >> a[i];
val=a[1];sort(a+1,a+33);
for(i=1;i<=32;i++){
if(a[i]==val)break;}
if(i==32)cout << 1 << '\n' ;
else if(i>=28)cout << 2 << '\n' ;
else if(i>=14)cout << 4 << '\n' ;
else if(i>=7)cout << 8 << '\n' ;
else if(i>=3)cout << 16 << '\n' ;
else cout << 32 << '\n' ;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3576kb
input:
2 5 teamA A accepted teamB B rejected teamC A accepted teamB B accepted teamD C accepted 4 teamA A rejected teamB A accepted teamC B accepted teamC B accepted
output:
1 32
result:
wrong answer 1st lines differ - expected: 'A', found: '1'