QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#251424 | #7619. Make SYSU Great Again I | jean# | WA | 0ms | 3824kb | C++14 | 667b | 2023-11-14 18:51:43 | 2023-11-14 18:51:44 |
Judging History
answer
#include"bits/stdc++.h"
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
map<pair<int,int>,int> mp;
for(int i = 1; i < n; i++) {
cout << i << " " << i << "\n";
mp[{i, i}] = 1;
cout << i << " " << i + 1 << "\n";
mp[{i, i + 1}] = 1;
}
mp[{n, n}] = 1, mp[{2, 1}] = 1;
cout << n << " " << n << "\n";
cout << 2 << " " << 1 << "\n";
int cnt = 2 * n + 1;
for(int i = 1; i <= n && cnt <= k; i++) {
for(int j = 1; j <= n && cnt <= k; j++) {
if(mp[{i, j}]) continue;
cout << i << " " << j << "\n";
cnt++;
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3824kb
input:
3 6
output:
1 1 1 2 2 2 2 3 3 3 2 1
result:
wrong answer The answer is wrong: The maximum common divisor of row 3 and column -2001406848 is not the same.