QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#565052 | #9308. World Cup | miku_HY | WA | 0ms | 3580kb | C++20 | 745b | 2024-09-15 20:03:16 | 2024-09-15 20:03:16 |
Judging History
answer
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define endl '\n'
using namespace std;
using ll =long long;
using pll=pair<ll,ll>;
const int mod=998244353;
ll ksm(ll a,ll b){
ll ans=1;
while(b){
if(b&1){
ans=(ans*a)%mod;
}
a=a*a%mod;
b>>=1;
}
return ans;
}
ll gcd(ll a,ll b){
ll t=a%b;
while(t){
a=b;b=t;t=a%b;
}
return b;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
ll get_inv(ll x){
return ksm(x,mod-2);
}
const int N=5e5+10;
bool cmp(pair<ll,string>a,pair<ll,string>b){
if(a.x==b.x)return a.y<b.y;
return a.x>b.x;
}
void solve(){
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int _=1;
cin>>_;
while(_--)solve();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3580kb
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