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