"C language" input an integer, to find its original code, anti-code, complement value

1#include <stdio.h>2#include <math.h>3 intMain ()4 {5     intm,n,a[Ten],i=0, y[ -],f[ -],b[ -],j,k;6printf"Please enter an integer:");7scanf"%d",&n);8m=ABS (n);9      while(m!=0)Ten     { Onea[i]=m%2; Am=m/2; -i=i+1; -     } the     if(n>=0) -     { -          for(j=0; j<i;j++) y[j]=A[j]; -         if((j+1)%8!=0) for(;(j+1)%8!=0; j + +) y[j]=0; +y[j]=0; -          for(k=0; k<=j;k++) +         { Af[k]=Y[k]; atb[k]=Y[k]; -         } -     } -     Else -     { -         intw=0; in          for(j=0; j<i;j++) y[j]=A[j]; -         if((j+1)%8!=0) for(;(j+1)%8!=0; j + +) y[j]=0; y[j]=1; to          for(k=0; k<j;k++)if(Y[k]) f[k]=0;Elsef[k]=1; f[k]=1; +          for(k=0; k<j;k++) {if(k==0) b[k]=f[k]+1;ElseB[k]=f[k]+w;if(b[k]==2) {b[k]=0; w=1;}Elsew=0;} b[k]=1; -     } theprintf"Original code:"); for(k=j;k>=0; k--) printf ("%d", Y[k]);p rintf ("\ n"); *printf"Anti-code:"); for(k=j;k>=0; k--) printf ("%d", F[k]);p rintf ("\ n"); $printf"Complement:"); for(k=j;k>=0; k--) printf ("%d", B[k]);p rintf ("\ n");Panax Notoginseng}

"C language" input an integer, the original code, anti-code, complement value