QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#744997#9627. 算术QOJericWA 0ms3624kbC++17399b2024-11-14 01:16:212024-11-14 01:16:21

Judging History

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

  • [2024-11-14 01:16:21]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3624kb
  • [2024-11-14 01:16:21]
  • 提交

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'