linhbuingoc / codility Goto Github PK

int distance = 0;
int lastDigit = 0;
int maxDistance = 0;
int trailGaurd = 0;
while (n > 0)
{
	// check the last digit
	lastDigit = n & 0x1;
	
	if (lastDigit == 1)
	{
		maxDistance = maxDistance <distance?distance:maxDistance;
		distance = 0;
		trailGaurd = 1;
	}
	else
	{
	    if(trailGaurd)
			distance++;
	}
	// if last digit is 1. then odd no
	n = n >> 1; 

printf(" %d ", MaxBinaryDistance(1028));

return 0;