QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#570756 | #9313. Make Max | yyf | WA | 0ms | 3676kb | C++14 | 487b | 2024-09-17 17:35:59 | 2024-09-17 17:36:03 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
int x;
int cnt=0;
for(int i=0;i<31;i++){
cin>>x;
if(x<n) cnt++;
}
if(cnt<2) cout<<32<<endl;
else if(cnt<6) cout<<16<<endl;
else if(cnt<13) cout<<8<<endl;
else if(cnt<27) cout<<4<<endl;
else if(cnt<31) cout<<2<<endl;
else cout<<1<<endl;
return ;
}
int 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
Wrong Answer
time: 0ms
memory: 3676kb
input:
4 2 1 2 2 2 2 7 1 1 1 2 2 2 2 3 1 2 3
output:
16 32 32 32
result:
wrong answer 1st numbers differ - expected: '1', found: '16'