QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #570523 | #9308. World Cup | dingjing | WA | 0ms | 3868kb | C++14 | 650b | 2024-09-17 16:16:52 | 2024-09-17 16:16:54 |
Judging History
answer
#include<iostream>
#include<algorithm>
using namespace std;
const int N=32;
int g[N];
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
for(int i=0;i<32;i++)
{
scanf("%d",&g[i]);
}
int k=g[0];
sort(g,g+32,cmp);
int i=0;
for(;i<32;i++)
{
if(g[i]==k) break;
}
if(i+1==1) puts("1");
else if(i+1<=10)
{
if(i+1>=5) puts("4");
else puts("2");
}
else if(i+1<=18) puts("4");
else if(i+1<=26)
{
if(i+1==19) puts("4");
else puts("8");
}
else if(i+1<=30) puts("16");
else puts("32");
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
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:
1
result:
ok 1 number(s): "1"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3788kb
input:
32 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...
output:
32 32 16 16 16 16 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 1
result:
wrong answer 28th numbers differ - expected: '2', found: '4'