#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define pri pair<int,int>
#define prl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pair<int,int>>
#define vpl vector<pair<ll,ll>>
#define re return 0
#define sqrt sqrtl
int32_t main() {
int k;cin>>k;
if (k<500 && k>0) {
cout<<k+3<<" "<<2*k+2<<endl;
for (int i = 2;i<k+3;i++) {
cout<<"1 "<<i<<endl;
cout<<i<<" "<<k+3<<endl;
}
} else cout<<"0 0"<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Correct. |
2 |
Correct |
0 ms |
348 KB |
Correct. |
3 |
Correct |
1 ms |
348 KB |
Correct. |
4 |
Correct |
0 ms |
348 KB |
Correct. |
5 |
Correct |
1 ms |
348 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Integer parameter [name=N] equals to 0, violates the range [1, 1000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Correct. |
2 |
Correct |
0 ms |
348 KB |
Correct. |
3 |
Correct |
1 ms |
348 KB |
Correct. |
4 |
Correct |
0 ms |
348 KB |
Correct. |
5 |
Correct |
1 ms |
348 KB |
Correct. |
6 |
Incorrect |
1 ms |
348 KB |
Integer parameter [name=N] equals to 0, violates the range [1, 1000] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Correct. |
2 |
Correct |
0 ms |
348 KB |
Correct. |
3 |
Correct |
1 ms |
348 KB |
Correct. |
4 |
Correct |
0 ms |
348 KB |
Correct. |
5 |
Correct |
1 ms |
348 KB |
Correct. |
6 |
Incorrect |
1 ms |
348 KB |
Integer parameter [name=N] equals to 0, violates the range [1, 1000] |
7 |
Halted |
0 ms |
0 KB |
- |