Collecting Trees
Submissions: 884   Accuracy:

67.93%

  Difficulty: Easy   Marks: 2

Given a number N, and an infinite supply of Complete Binary Trees of various depths. Your task is to pick minimum number of binary trees such that sum of total number of leaf node of each tree you have picked is N

Note: For binary tree with only root node: Depth=1, Leaf nodes=1

Input:
First line of input consist of a single integer T denoting the total number of test case. Then T test cases follow. Each line of test case contains a single integer N,as described in the problem statement.


Output:
For each test case, print a single line containing the minimum number of trees you need to pick.


Constraints:
1<=T<=100
1<=N<=10^9

Example:
Input:
2
1
5

Output:
1
2

Explanation:
1. For the first test one binary tree is sufficient.
2. For the second test case pick 2 binary trees of depth 1 and 3 .

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Pranay Pandey
Author: pra1nay7_313


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.