Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n;
- int pow(int x){
- int a=1;
- for(int i=1;i<=x;i++) a=a*2;
- return a;
- }
- int main(){
- scanf("%d",&n);
- for(int i=0;i<pow(n);i++){
- for(int j=0;j<n;j++){
- int x=i,y=pow(j);
- y=x|y;
- if(x!=y){
- int cnt=0;
- vector <int> v;
- int r=1;
- if(x==0){
- for(int k=0;k<n;k++) printf("0");
- }
- else {
- while(x>0){
- r=x%2;
- x=x/2;
- v.push_back(r);
- cnt++;
- }
- if(cnt!=n) for(int k=1;k<=n-cnt;k++) v.push_back(0);
- for(int k=v.size()-1;k>=0;k--) printf("%d",v[k]);
- }
- cnt=0;
- printf(" ");
- v.clear();
- while(y>0){
- r=y%2;
- y=y/2;
- v.push_back(r);
- cnt++;
- }
- if(cnt!=n) for(int k=1;k<=n-cnt;k++) v.push_back(0);
- for(int k=v.size()-1;k>=0;k--) printf("%d",v[k]);
- printf("\n");
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement