QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#573333 | #9308. World Cup | Chief_Ning | WA | 0ms | 3656kb | C++14 | 1.8kb | 2024-09-18 18:11:51 | 2024-09-18 18:11:55 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define pq priority_queue<int>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define debug1(x) cout<<x<<endl;
#define debug2(a,b) cout<<a<<" "<<b<<endl;
const int INF = 0x3f3f3f3f;//无穷大
const int inf = 0xc0c0c0c0;//无穷小
const int MOD = 1;
const int N = 1;
/*
________ ___ ___ ___ _______ ________ ________ ___ ________ ________
|\ ____\|\ \|\ \|\ \|\ ___ \ |\ _____\\ ___ \|\ \|\ ___ \|\ ____\
\ \ \___|\ \ \\\ \ \ \ \ __/|\ \ \__/\ \ \\ \ \ \ \ \ \\ \ \ \ \___|
\ \ \ \ \ __ \ \ \ \ \_|/_\ \ __\\ \ \\ \ \ \ \ \ \\ \ \ \ \ ___
\ \ \____\ \ \ \ \ \ \ \ \_|\ \ \ \_| \ \ \\ \ \ \ \ \ \\ \ \ \ \|\ \
\ \_______\ \__\ \__\ \__\ \_______\ \__\ \ \__\\ \__\ \__\ \__\\ \__\ \_______\
\|_______|\|__|\|__|\|__|\|_______|\|__| \|__| \|__|\|__|\|__| \|__|\|_______|
*/
void ChiefNing()
{
int a[33];
int cn;
for(int i=1;i<=32;i++){
cin>>a[i];
cn=a[1];
}
sort(a+1,a+32);
int mp=0;
for(int i=1;i<=32;i++){
if(a[i]==cn){
mp=i;
break;
}
}
if(mp==32){
cout<<1<<endl;
}
else if(mp<32&&mp>=16){
cout<<2<<endl;
}
else if(mp<16&&mp>=8){
cout<<4<<endl;
}
else if(mp<8&&mp>=4){
cout<<8<<endl;
}
else if(mp<4&&mp>=2){
cout<<16<<endl;
}
else if(mp==1){
cout<<32<<endl;
}
}
signed main(void)
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int _;
cin>>_;
while(_--)
ChiefNing();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3656kb
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'