**Problem Statement :**

The problem solvers have found a new castle for coding and named it as Nik’s castle. These smart people were given a task to make the purchase of items at the castle easier by distributing various coins with different values. Rahul has come up with a solution that if we make coins category starting from $1 till the maximum price of the item present on castle, then we can purchase any item easily. He

added following example to prove his point. Let’s suppose the maximum price of an item is 5$ then we can make coins of {$1, $2, $3, $4, $5} to purchase any item ranging from $1 to $5.

Now Tej, being a keen observer suggested that we could actually minimize the number of coins required and gave

following distribution {$1, $2, $3}. According to him, any item can be purchased one time ranging from $1 to $5. Everyone was impressed with both of them. Your task is to help Tej your dear friend to come up with the minimum number of denominations for any arbitrary max price in castle.

**Input Format:**

First line contains an integer T denoting the number of test

cases. Next T lines contains an integer N denoting the

maximum price of the item present on Nik’s castle.

**Output Format:**

For each test case print a single line denoting the minimum

a number of denominations of coins required.

**Constraints:**

1<=T<=100

1<=N<=5000

**Sample Input 1 :**

2

10

5**Sample Output 1 :**

4

3**Explanation :**

According to Rahul {$1, $2, $3,… $10} must be distributed. But as per Tej only {$1, $2, $3, $4} coins are enough to purchase any item ranging from $1 to $10. Hence minimum is 4. Likewise denominations could also be {$1, $2, $3, $5}.

Hence answer is still 4.**Sample Input 2 :**

3

1

5

7**Sample Output 2 :**

1

3

3**Explanation :**

According to Rahul {$1, $2, $3, $4, $5} must be distributed. But

as per Tej only {$1, $2, $3} coins are enough to purchase any

item ranging from $1 to $5. Hence minimum is 3. Likewise

denominations could also be {$1, $2, $4}. Hence answer is still

3.

**Solution:**

**C**

```
//www.codewindow.in
//start
#include<stdio.h>
int main(){
int n,test,i;
scanf("%d",&test);
for(i=0;i<test;i++)
{
scanf("%d",&n);
int x=0;
while(pow(2,x)<=n)
{
x++;
}
printf("%d\n",x);
}
return 0;
}
//end
```

**JAVA**

```
//www.codewindow.in
//start
import java.io.*;
public class Main
{
public static void main(String[] args)throws IOException
{
BufferedReader br=new BufferedReader(new
InputStreamReader(System.in));
int i;
int test=Integer.parseInt(br.readLine());
for(i=0;i<test;i++){
int n=Integer.parseInt(br.readLine());
int x=0;
while(Math.pow(2,x)<=n){
x++;
}
System.out.println(x);
}
}
}
//end
```

**Python**

```
#www.codewindow.in
#please follow the indentation as its a must in python programing
cases=int(input())
for i in range(1,cases+1):
value=int(input())
coincount = 0
while value>=1:
value=value//2
coincount=coincount+1
print (coincount)
#end
```

**Follow Us**

**Also checkout**

- Autobiography Number Solution | Codewindow.in
- Count kth Digit Solution | Codewindow.in
- Revature Interview Experience | Part 1 | Codewindow.in
- Persistent Interview Experience | Codewindow.in
- L&T Off Campus Drive 2021 | Senior Engineer | 2019/ 2020/2021 | Codewindow.in
- Cognizant GenC Recruitment Drive | Programmer Trainee | Codewindow.in
- Amdocs Off Campus Hiring | System Analyst | Codewindow.in
- Zoho Off Campus Hiring | Software Developer | 2018/ 2019/ 2020/2021 | Codewindow.in
- Kumaran Systems Off Campus Hiring | Trainee Programmer | 2020 2019 | Codewindow.in
- Accenture ASE Interview Experience
- CodeLogicX Recruitment Drive | Software Developer Trainee | 2021, 2021 | Codewindow.in
- Accenture SE Interview Experience
- Juspay Hiring Challenge | Think big with Functional Programming | Codewindow.in
- Exam Answers
- IBM Off Campus Hiring | Associate System Engineer | Codewindow.in
- FindMax Problem
- Walmart Off Campus Hiring | Walmart CodeHers | Codewindow.in
- Quadratic Equation Solution | Codewindow.in
- Accenture Solution | Code in Marathon | Codewindow.in
- Amazon Off Campus Internship Drive | Amazon WoW for the batch of 2022, 2023, and 2024 | Codewindow.in
- Binary Tree Combination
- Sum of all the prime divisors of a number
- Mindtree Interview Questions and Experience Part 1 | Codewindow.in
- Apisero Off Campus Recruitment Drive | Software Engineer | 2021 2020 2019 2018 | Codewindow.in
- Infosys Mega Off Campus HIring | Technincal Process Executive | Codewindow.in
- Amazon Off Campus Hiring | Software Development Engineer | 2021/2020/2019/2018 | Codewindow.in
- Question 3 Solution | Duplicate Elements Solution | Codewindow.in
- Question 2 Solution | Second Largest Solution | Codewindow.in
- Question 1 Solution | Palindrome Solution | Codewindow.in
- Question 2 Coding Solution | Weak String Problem | Codewindow.in
- Question 1 Coding Solution | Permutation Problem | Codewindow.in
- XL Dynamics Off Campus Hiring | 2022 2021 2020 | Codewindow.in
- Accenture Full Question Paper Set | Codewindow.in
- Accenture Aptitude Questions and Solution | Codewindow.in
- Accenture Logical Reasoning Questions and Solution | Codewindow.in
- MountBlue Solution | PlayGame Code | Codewindow.in
- MountBlue Solution | !On Off Code | Codewindow.in
- Revature Answer | 2021
- IBM Mixed Fraction Code Solution | CodeWindow.in
- IBM Volume of Pizza Slice Solution | CodeWindow.in
- Accenture Running Distance Code Solution
- Accenture Pizza Code Solution
- Cognizant GENC Off-Campus | 2021 | CodeWindow.in
- Revature Coding Solution with proof | Array Operation: Ascending order | Codewindow.in
- Coding Sample Questions | Part 4 | Codewindow.in
- IBM Off Campus Recruitment | Systems Engineer | 2018 2019 2020 | Codewindow.in
- Deloitte Off Campus Hiring Drive | Associate Solution Advisor | 2020, 2021 | Codewindow.in
- Coding Sample Questions | Part 3 | Codewindow.in
- Capgemini Tech Challenge 2021 | 2 Lacs Worth Prize | Chance of getting Hired | 2018-2023 | Codewindow.in
- Prolifics Recruitment Drive | Trainee | B. Tech/M. Tech/B.E./MCA | Codewindow.in