1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <bits/stdc++.h>
using namespace std;
const long long miliard = 1000000000;
int main() {
    std::ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector <int> con[101];
    int temp = 1, id = 1;
    while(temp <= miliard) {
        con[id].push_back(id + 1);
        con[id].push_back(id + 2);
        con[id + 1].push_back(id + 2);
        temp = temp * 2;
        id += 2;
    }
    id ++;
    temp = n;
    int x = 536870912;
    vector <int> wek1, wek2;
    for(int i = 29; i >= 0; i --) {
        if(x <= temp) {
            wek1.push_back(i * 2 + 2);
            temp -= x;
        }
        x = x / 2;
    }
    while(wek1.size() > 0){
        if(wek1.size() <= 2) {
            for(int i = 0; i < wek1.size(); i ++) con[wek1[i]].push_back(100);
            break;
        }
        else {
            if(wek1.size() % 2 == 0) {
                for(int i = 0; i < wek1.size(); i += 2) {
                    wek2.push_back(id);
                    con[wek1[i]].push_back(id);
                    con[wek1[i + 1]].push_back(id);
                    id ++;
                }
            }
            else {
                for(int i = 0; i < wek1.size() - 1; i += 2) {
                    wek2.push_back(id);
                    con[wek1[i]].push_back(id);
                    con[wek1[i + 1]].push_back(id);
                    id ++;
                }
                wek2.push_back(wek1[wek1.size() - 1]);
            }
            wek1 = wek2;
            wek2.clear();
        }
    }
    cout << 100 << '\n';
    for(int i = 1; i <= 100; i ++) {
        if(con[i].size() == 0) cout << "-1 -1\n";
        else if(con[i].size() == 1) cout << con[i][0] << " -1\n";
        else cout << con[i][0] << ' ' << con[i][1] << '\n';
    }
    return 0;
}