oj.uz

답안 #845189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845189 2023-09-06T12:30:32 Z vjudge1 Konstrukcija (COCI20_konstrukcija) C++17
0 / 110
 2 ms 344 KB 
#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define spc << " " <<
#define all(x) x.begin(), x.end()
#define ll long long
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 1000000007

using namespace std;





void solve(){
    int k; cin >> k;
    if(k==1){
        cout << "1 0" << endl;
        return;
    }
    if(1<=k && k<500){
        cout << k+3 spc 2*k+2 << endl;
        for(int i=2; i<=k+2; i++){
            cout << 1 spc i << endl;
            cout << k+3 spc i << endl;
        }
    }
}



signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out","w",stdout);
    #endif
    

    ll t=1;
    //cin >> t;
    while(t--) solve();
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -