Nanaya's favorite Dual horsetail robot has run out of power!
  As a best friend of Nanaya, Cdfpysw decide to do something for him.
  Cdfpysw, the king of alpaca, has some very powerful energy balls numbered by 1,2,3……n. He let Nanaya divide them into some sets to save the robot.
  However, if there are three balls whose numbers are labeled X,Y and X&Y in the same set, they will explode! Nanaya must divide these balls into some sets and avoid explosion.
  Nanaya is a shy man, he don't want to divide these balls into too many sets. Please tell him the minimum number of sets.

  The first line contains an integer T, indicating the number of cases.
  The next T line, each line contains an integer n indicating the number of balls. (1 <= n <= 10⁹)

  For each test case in the input, print one line: "Case #X: Y", where X is the test case number (starting with 1) and Y represents the minimum number of sets.

2
2
3

Case #1: 1
Case #2: 2

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#include <ctype.h>

#include <math.h>

#include <iostream>

#include <string>

#include <algorithm>

#define PI acos(-1.0)

#define INF 1e9

using namespace std;

int dd[100];

int main()

{

    int t;

    scanf("%d", &t);

    int n;

    memset(dd, 0, sizeof(dd));

    int ans;

    int e=1;

    dd[e++]=1;

    ans=1;

    int i=1;

    while(ans < INF )

    {

        ans=ans+pow(2, i);

        i++;

        dd[e++]=ans;

    }

   // printf("-----%d\n", i);

    int cnt=1;

    while(t--)

    {

        scanf("%d", &n);

        int pos;

        for(i=0; i<e; i++)

        {

            if(n>=dd[i] && n<dd[i+1])

            {

                pos=i; break;

            }

        }

        printf("Case #%d: %d\n", cnt++, pos );

    }

    return 0;

}