Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<stdio.h>
- using namespace std;
- class Gray
- {
- int m;
- long n;
- int A[65538];
- public:
- void nhap();
- void xuat();
- };
- void Gray::xuat()
- {
- int b[20];
- for(int i=0;i<n;i++)
- {
- int k=0;
- int u=A[i];
- while(u>0)
- {
- b[k++]=u%2;
- u/=2;
- }
- for(int j=k+1;j<=m;j++) printf("0");
- while(k>=1) printf("%d",b[--k]);
- printf("\n");
- }
- }
- void Gray::nhap()
- {
- cin>>m;
- A[0]=0;
- A[1]=1;
- int p=1;
- n=2;
- for(int i=2;i<=m;i++)
- {
- p=p*2;
- int u=2*n-1;
- for(int j=n;j<=u;j++) A[j]=A[u-j]+p;
- n=n*2;
- }
- }
- int main()
- {
- Gray G;
- G.nhap();
- G.xuat();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement