QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#689485 | #7619. Make SYSU Great Again I | lllei# | WA | 0ms | 3588kb | C++20 | 489b | 2024-10-30 17:20:18 | 2024-10-30 17:20:20 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,k;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>k;
int flag=0,x=1,y=1;
for(int i=1;i<=2*n-1;i++)
{
cout<<x<<" "<<y<<'\n';
if(flag==0)x++;
else y++;
flag^=1;
}
k-=2*n-1;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(i==j||i-1==j)continue;
cout<<i<<" "<<j<<'\n';
if(k==0)break;
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3588kb
input:
3 6
output:
1 1 2 1 2 2 3 2 3 3 1 2 1 3 2 3 3 1
result:
wrong answer The answer is wrong: The maximum common divisor of row 3 and column 739394688 is not the same.