QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #83230 | #5575. Knight's Tour Redux | XKError | WA | 2ms | 3584kb | C++ | 194b | 2023-03-01 08:33:45 | 2023-03-01 08:33:48 |
Judging History
answer
#include <bits/stdc++.h>
#define maxn 100005
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n == 1) puts("POSSIBLE\n1 1");
else puts("IMPOSSIBLE");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3584kb
input:
1
output:
POSSIBLE 1 1
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 3384kb
input:
2
output:
IMPOSSIBLE
result:
ok answer = 0
Test #3:
score: 0
Accepted
time: 0ms
memory: 3424kb
input:
3
output:
IMPOSSIBLE
result:
ok answer = 0
Test #4:
score: 0
Accepted
time: 2ms
memory: 3424kb
input:
4
output:
IMPOSSIBLE
result:
ok answer = 0
Test #5:
score: -100
Wrong Answer
time: 2ms
memory: 3420kb
input:
5
output:
IMPOSSIBLE
result:
wrong answer jury has the better answer: jans = 1, pans = 0 (1 is Possible)