Advertisement
Guest User

Untitled

a guest
Jan 18th, 2020
95
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.33 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int n;
  4.  
  5. int pow(int x){
  6. int a=1;
  7. for(int i=1;i<=x;i++) a=a*2;
  8. return a;
  9. }
  10.  
  11. int main(){
  12. scanf("%d",&n);
  13. for(int i=0;i<pow(n);i++){
  14. for(int j=0;j<n;j++){
  15. int x=i,y=pow(j);
  16. y=x|y;
  17. if(x!=y){
  18. int cnt=0;
  19. vector <int> v;
  20. int r=1;
  21. if(x==0){
  22. for(int k=0;k<n;k++) printf("0");
  23. }
  24. else {
  25. while(x>0){
  26. r=x%2;
  27. x=x/2;
  28. v.push_back(r);
  29. cnt++;
  30. }
  31. if(cnt!=n) for(int k=1;k<=n-cnt;k++) v.push_back(0);
  32. for(int k=v.size()-1;k>=0;k--) printf("%d",v[k]);
  33. }
  34.  
  35. cnt=0;
  36. printf(" ");
  37. v.clear();
  38. while(y>0){
  39. r=y%2;
  40. y=y/2;
  41. v.push_back(r);
  42. cnt++;
  43. }
  44. if(cnt!=n) for(int k=1;k<=n-cnt;k++) v.push_back(0);
  45. for(int k=v.size()-1;k>=0;k--) printf("%d",v[k]);
  46. printf("\n");
  47. }
  48. }
  49. }
  50.  
  51.  
  52. return 0;
  53. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement