QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #471902 | #4325. Kraljice | Nevll | 0 | 0ms | 3944kb | C++14 | 400b | 2024-07-11 11:15:03 | 2024-07-11 11:15:04 |
answer
# include <bits/stdc++.h>
# define ll long long
# define ld double
# define fi first
# define se second
# define pii pair<int, int>
# define pll pair<ll, ll>
# pragma GCC optimize("O3")
using namespace std;
int main() {
int N;
scanf("%d", &N);
if(N%2 == 0) N--;
printf("%d\n", N * N);
for(int k=1;k<=N;k++) {
for(int i=1;i<=N;i++) {
printf("%d %d\n", i, k);
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 6
Accepted
time: 0ms
memory: 3856kb
input:
1
output:
1 1 1
result:
ok 1 queen(s)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
2
output:
1 1 1
result:
ok 1 queen(s)
Test #3:
score: -6
Wrong Answer
time: 0ms
memory: 3944kb
input:
3
output:
9 1 1 2 1 3 1 1 2 2 2 3 2 1 3 2 3 3 3
result:
wrong answer the cell (2, 1) is attacking by 1 queen(s)
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Skipped
Dependency #1:
0%