#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
pair<int,int> ans[107];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k;
cin>>k;
for(int i=1;i<60;i++)
{
if(i%2==1) ans[i]={i+1,i+2};
else ans[i]={i+1,-1};
}
ans[60]={-1,-1};
ans[61]={-1,-1};
ans[62]={-1,-1};
int i=2;
while(k>0)
{
if((k&1)) ans[i].nd=62;
k/=2;
i+=2;
}
cout<<62<<endl;
for(int i=1;i<=62;i++) cout<<ans[i].st<<" "<<ans[i].nd<<endl;
return 0;
}
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 | #include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long ll mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; pair<int,int> ans[107]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int k; cin>>k; for(int i=1;i<60;i++) { if(i%2==1) ans[i]={i+1,i+2}; else ans[i]={i+1,-1}; } ans[60]={-1,-1}; ans[61]={-1,-1}; ans[62]={-1,-1}; int i=2; while(k>0) { if((k&1)) ans[i].nd=62; k/=2; i+=2; } cout<<62<<endl; for(int i=1;i<=62;i++) cout<<ans[i].st<<" "<<ans[i].nd<<endl; return 0; } |
English