QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#578108 | #9308. World Cup | aikongsky | WA | 0ms | 3552kb | C++14 | 545b | 2024-09-20 16:39:10 | 2024-09-20 16:39:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 33;
int a[N];
int t;
void solve()
{
int stand = 0,cnt = 0;
for(int i = 1;i <= 32;i++)
{
scanf("%d",&a[i]);
stand = a[1];
if(stand > a[i]) cnt++;
}
if(cnt == 7) cout<<"1"<<endl;
else if(cnt == 6) cout<<"2"<<endl;
else if(cnt == 5) cout<<"4"<<endl;
else if(cnt == 4) cout<<"8"<<endl;
else if(cnt == 3) cout<<"16"<<endl;
else if(cnt < 2) cout<<"32"<<endl;
}
int main()
{
cin>>t;
while(t--)
{
solve();
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3552kb
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:
result:
wrong answer Answer contains longer sequence [length = 1], but output contains 0 elements