Untitled
unknown
plain_text
4 years ago
128 B
5
Indexable
int solve(int A) {
int mask=1;
int count=0;
while(mask&A==0)
{
count++;
mask=mask<<1;
}
return count;
}Editor is loading...
int solve(int A) {
int mask=1;
int count=0;
while(mask&A==0)
{
count++;
mask=mask<<1;
}
return count;
}