QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #505346 | #9106. Zayin and Dirichlet | Afterlife | WA | 0ms | 3692kb | C++20 | 290b | 2024-08-05 03:25:58 | 2024-08-05 03:25:58 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n , c , d;
int a[1005];
int main() {
cin >> n >> c >> d;
for(int i = 0;i <= n;i++) cin >> a[i];
if(a[0] == 1) cout << "1\n1 1\n";
else {
if(n == 1) cout << "1\n1 1\n";
else cout << "-1\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3536kb
input:
2 2 1 1 1 1
output:
1 1 1
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
2 2 1 998244352 998244352 1
output:
-1
result:
ok single line: '-1'
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3692kb
input:
1 1 1 998244352 1
output:
1 1 1
result:
wrong answer 2nd lines differ - expected: '998244352 1', found: '1 1'