QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#744997 | #9627. 算术 | QOJeric | WA | 0ms | 3624kb | C++17 | 399b | 2024-11-14 01:16:21 | 2024-11-14 01:16:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int Mod= 998244353;
inline ll binpow(ll a, ll b, ll p=Mod) {
ll res = 1;
a = a % p;
while (b > 0) {
if (b & 1) res = (res * a) % p;
a = (a * a) % p;
b >>= 1;
}
return res;
}
int main(){
int _;
cin>>_;
while(_--){
cout<<1<<endl;
}
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3624kb
input:
7 5 3 0 0 0 0 0 0 0 4 1 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 2 99 88 77 66 55 44 33 22 11 100 90 80 70 60 50 40 30 20
output:
1 1 1 1 1 1 1
result:
wrong answer 1st lines differ - expected: '54', found: '1'