QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #577460 | #9308. World Cup | zjhhhzj | WA | 0ms | 3704kb | C++17 | 626b | 2024-09-20 11:38:14 | 2024-09-20 11:38:14 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod (1000000007)
#define PII pair<int,int>
#define F first
#define S second
#define N 200005
ll n,m,a[N];
void solve() {
int x,mx,mi,y;
cin>>x;
for(int i=1;i<=31;i++){
cin>>y;
if(y>x)mx++;
else mi++;
}
if(mi==31)cout<<"1\n";
else if(mi<31)cout<<"2\n";
else if(mi<27)cout<<"3\n";
else if(mi<13)cout<<"4\n";
else if(mi<6)cout<<"5\n";
else if(mi<2)cout<<"6\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int _ = 1;
cin >> _;
while (_--) {
solve();
}
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3704kb
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