|
/*
** Bit counter by Ratko Tomic
*/
long atol( const char *_Str);
int printf( const char * _Format, ...);
int bit_count(long x)
{
int n = 0;
if (x) do
n++;
while (0 != (x = x&(x-1))) ;
return(n);
}
main(int argc, char *argv[])
{
long n;
while(--argc)
{
int i;
n = atol(*++argv);
i = bit_count(n);
printf("%ld contains %d bits set\n",n, i);
}
return 0;
}
|
By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.
If a file you wish to view isn't highlighted, and is a text file (not binary), please
let us know and we'll add colourisation support for it.
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.