Submission #845502

#TimeUsernameProblemLanguageResultExecution timeMemory
845502vjudge1Konstrukcija (COCI20_konstrukcija)C++14
15 / 110
2 ms348 KiB
// Aber der schlimmste Fiend, dem du begegnen kannst, wirst du immer dir selber sein
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define rev reverse
#define all(x) x.begin(),x.end()
#define acc accumulate
#define sz size()
#define MOD 1000000007
#define rall(x) x.rbegin(),x.rend()
#define rep(i, x, n) for(int i = x; i < n; i++)
using namespace std;
const int N = 2e5 + 5;
inline void solve(){
    int n;
    cin >> n;
    n++;
    if( n >= 1){
        cout << n+2 << " " << 2 * n << endl;
        for(int i = 2; i < n+2; i++){
            cout << 1 << " " << i << endl;
            cout << i << " " << n+2 << endl;
        }
    }
}   
int main(){
    fast_io
    int t;
    t = 1;
    while(t--) solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...