This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 20;
const ll MAXN = 3e5 + 5;
int main() {
fast
int K;
cin >> K;
if (K >= 0) {
int N = abs(K)+4;
cout << N << " " << (N-3)*2 << "\n";
for (int i = 2; i <= N-2; i++) {
cout << "1 " << i << "\n";
cout << i << " " << N << "\n";
}
} else {
int N = 4 + abs(K);
int M = 4 + 2*abs(K);
cout << N << " " << M << "\n";
cout << "1 2\n1 3\n2 3\n3 " << N << "\n";
for (int i = 4; i <= N-1; i++) {
cout << 1 << " " << i << "\n";
cout << i << " " << N << "\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |