QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #102738 | #5255. Greedy Drawers | fz_zsl# | WA | 2ms | 3448kb | C++17 | 552b | 2023-05-03 16:51:11 | 2023-05-03 16:51:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) printf("%d %d\n", i, 1000 - i);
putchar('\n');
for (int l = 1; l <= N; l += 8) {
if (l + 7 <= N) {
for (int j = 0; j <= 7; j++) {
int i = j + l;
if (j != 3) {
printf("%d %d\n", (i / 4 + 1 - (j == 7)) * 4, 1000 - (i / 4 - (j == 7)) * 4);
} else {
printf("%d %d\n", i + 1, 1000 - i + 1);
}
}
} else {
for (int j = l; j <= N; j++) {
printf("500 500\n");
}
}
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3448kb
input:
150
output:
1 999 2 998 3 997 4 996 5 995 6 994 7 993 8 992 9 991 10 990 11 989 12 988 13 987 14 986 15 985 16 984 17 983 18 982 19 981 20 980 21 979 22 978 23 977 24 976 25 975 26 974 27 973 28 972 29 971 30 970 31 969 32 968 33 967 34 966 35 965 36 964 37 963 38 962 39 961 40 960 41 959 42 958 43 957 44 956 4...
result:
wrong answer there are no solutions in your plan