#include <stdio.h>
#include <math.h>
          
void print_bits(int x){
         
        unsigned mask=1<<sizeof(unsigned)*8-1;
                        
                
        /* uzimamo broj jedan, koji ima reprezentaciju
        00000...01
        i obrcemo ga u 1000...00
        */
        
        /* zatim siftujemo udesno dobijeni broj i svaki
        put primenjujemo operaciju bitovske konjukcije
        sa x */
        
        while(mask!=0) 
        {
                if(mask&x)
                        printf("1");
                else
                        printf("0");
                mask=mask>>1;
        }
        printf("\n");
        return ;
}

int getk(int x, unsigned k){
	unsigned mask = 1<<k;
	return (x & mask)?1:0;
}

/*povratna vrednost je broj sa postavljenom jedinicom na k-tom mestu */
int setk1(int x, unsigned k){
	unsigned mask = 1<<k;
	return x | mask;
}

int setk0(int x, unsigned k){
	unsigned mask = ~(1<<k);
	return x & mask;
}

int suma_bitova(int x){
	int suma = 0,i;
	
	for(i=0; i<sizeof(x)*8; i++)
		suma+=getk(x,i);

	return suma;
}

/* pozicija p se broji sa desna na levo */
unsigned get_bits(unsigned x, int p, int n){

	int i;
	for(i=0; i<sizeof(x)*8; i++){
		if(i<p || i>p+n)
			x=setk0(x,i);
	}
	return x;
}

unsigned get_bits1(unsigned x, int p, int n){

	unsigned mask = (~((~0)<<n))<<p; 
	/* ~0 = 1111111...1
	   <<n= 111....1000 (n 0 na kraju)
	   ~  = 00000...111 (n 1 na kraju)
           <<p= 00001110000 (n 1 pomerenih za p od desnog kraja)
	*/
	return x & mask;
}

unsigned invert_bits(unsigned x, int p, int n){
	unsigned mask = (~((~0)<<n))<<p; 
	return x ^ mask;
}

unsigned mirror(unsigned x)
{
	unsigned mask=1;
	int pom=0,i,n=sizeof(x)*8;

	for(i=0;i<n;i++){
		pom=(pom<<1)+(x&mask);
		x=x>>1;
	}
	return pom;
}

unsigned uzastopne1(unsigned x){
	int i;
	unsigned mask = 3; /* bin. repr. 000..011 */
	int uzast=0;

	for(i=0; i<sizeof(x)*8; i++){
		if((mask & x>>i)==3)
			uzast++;
	}
	return uzast;
}

        
int main(){
	unsigned x = 89;
        print_bits(x);
	printf("%d\n",getk(x,0));
	printf("%d\n",getk(x,1));
	printf("%d\n",getk(x,2));
	printf("%d\n",getk(x,3));
	printf("%d\n",getk(x,4));

	printf("%d\n",setk1(x,2));
	printf("%d\n",setk0(x,3));
	printf("%d\n",suma_bitova(x));
	
	print_bits(x);
	print_bits(get_bits(x,5,3));
	print_bits(get_bits1(x,5,3));
	print_bits(invert_bits(x,5,3));
	print_bits(mirror(x));
	printf("%d\n",uzastopne1(x));
        return 0;
}