C :

#include<stdio.h>
int n,x;
int main()
{scanf("%d",&n);
	while(n--){
		int t=0;scanf("%d",&x);
		while(x>0){x=x>>1;t++;}
		printf("%d\n",t);
	}return 0;
}

C++ :

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()                                                   
{
    int n;
    cin>>n;
    int t,cc[n+1],pp=1,ll=0;
	long long k,hh,s;
    for(int i=1;i<=n;i++)
    {
    	cin>>t;
    	k=1;
    	s=0;
    	hh=1;
    	for(int l=1;l>0;l++)
    	{
    		ll=l;
    		s+=k;
    		k*=2;
    		if(s>=t) break;
    	}
    	cc[pp]=ll;
    	pp++;
    }
    for(int i=1;i<=n;i++)
    {
    	cout<<cc[i]<<endl;
    }
	return 0;
}

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		while(T>0) {
			int n = sc.nextInt();
			for (int j = 0; j <= n; j++) {
				if(n>=Math.pow(2, j-1)&&n<Math.pow(2, j)) {
					System.out.println(j);
					break;
				}
			}
			T--;
		}
	}
}