Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- int main()
- {
- int done[64],i,j,q[6],reg,sum;
- memset(done,0,sizeof done);
- for(i=0;i<64;i++)
- {
- if(!done[i])
- {
- printf("Ciklus:");
- reg=i;
- sum=0;
- do
- {
- done[reg]=1;
- printf(" %d",reg);
- sum++;
- for(j=0;j<6;j++)
- {
- q[j]=(reg&(1<<j))>>j;
- }
- reg&=31;
- reg<<=1;
- reg+=(q[5]^q[1]^(q[0]&q[2])^((!q[4])|(!q[3])))? 1:0;
- } while(!done[reg]);
- printf("\nHossza: %d\n\n",sum);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment