QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#574681#9308. World Cuplolid_ddfWA 0ms3656kbC++14749b2024-09-18 23:46:592024-09-18 23:46:59

Judging History

你现在查看的是最新测评结果

  • [2024-09-18 23:46:59]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3656kb
  • [2024-09-18 23:46:59]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef float f;
int lowbit(int x){return x&-x;}
void solve()
{
    int a[35];
    for(int i=1;i<=32;i++)
    {
        cin>>a[i];
    }
    int count=a[1];
    sort(a,a+32,greater<int>());
    for(int i=1;i<=32;i++)
    {
        if(a[i]==count){count=i;break;}
    }
    if(count==1)cout<<1;
    else if(count>=2&&count<=5)cout<<2;
    else if(count>=6&&count<=19)cout<<4;
    else if(count>=20&&count<=26)cout<<8;
    else if(count>=27&&count<=30)cout<<16;
    else cout<<32;
}

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t;
    //t=1;
    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: 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:

32

result:

wrong answer 1st numbers differ - expected: '1', found: '32'