Find Next Minimum Supermask Of a Which Is Greater Or Equal b

Code:

	int nextSuperMaskOfA(int a,int b)
	{
	int fg = 0;
	for(int i=30 ; i>=0 ; i--){
	if(Cheek(a, i) && !Cheek(b, i)){
	b = Set(b, i);
	fg = 1;
	}
	else if(fg && Cheek(a, i) == false && Cheek(b, i)){
	b = Reset(b, i);
	}
	}
	return b;
	}

view raw supermask.cpp hosted with ❤ by GitHub

Related Problem

Happy Coding