QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#571289#9308. World Cupxlc2024WA 0ms3756kbC++14599b2024-09-17 21:44:312024-09-17 21:44:31

Judging History

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

  • [2024-09-17 21:44:31]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3756kb
  • [2024-09-17 21:44:31]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int val,pos,a[40];

int main(){
	int T;
	scanf("%d",&T);
	while (T--){
		for (int i=0;i<32;i++) scanf("%d",&a[i]);
		val=a[0];
		sort(a,a+32);
		for (int i=0;i<32;i++)
			if (val==a[i]){
				pos=i;
				break;
			}
		
		if (pos<2){
			printf("32\n");
		}else if (pos>=2 and pos<6){
			printf("16\n");
		}else if (pos>=6 and pos<8){
			printf("8\n");
		}else if (pos>=8 and pos<16){
			printf("4\n");
		}else if (pos>=16 and pos<32){
			printf("2\n");
		}else if (pos==31){
			printf("1\n");
		}
		
		
	}
	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3756kb

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'