CareerCup

clear the bit 1 to 8 and then shift the result to the left of 8 bits. The result is the solution...

inline unsigned int mod256(unsigned int _i)
{
_i &= (~255);
_i >>= 8;
return _i;
}

- Nostra December 11, 2009 | Flag Reply

For eq., numbers form 0..254 are 0 multiples of 256.
255..511 are 1 multiple of 256 and so on.

- Pia December 04, 2009 | Flag Reply

{{{ a= 255; //lets say x is the number for which you want to check the multiplicity int i =0; if(x) { x = x&(!a); a<<8; i++; } return i; } - Mohit December 04, 2009 | Flag Reply

why 255 is 1 multiple of 256?

- Anonymous December 29, 2009 | Flag Reply

Use nth roots. For example 1=256^0, 2=256^(1/8). Use the binary representation of the number to represent any number.

- Anonymous March 05, 2010 | Flag Reply

int reprensent_256times(int num){
	num&=~255;
	return num>>8;
}

- Yimin November 01, 2010 | Flag Reply

If number is -512 then result should be -2, if number is 0 then result should be 0 and if number is 512 then result should be 2.

Then simply the following code will work

int represt_256( int num)
{
return num >> 8;
}

- Anonymous December 13, 2010 | Flag Reply

if (number%256==0)
{
number is multiple of 256
}
else
number is not multiple of 256

- Anonymous July 25, 2010 | Flag Reply