Maximum height of the staircase
Submissions: 11059   Accuracy:

50%

  Difficulty: Easy   Marks: 2

Given N number of square blocks. The height of each square block is 1. The task is to create a  staircase of max height using these blocks.

Note: The first stair would require only one block, the second stair would require two blocks and so on.

Input:

The first line of the input contains T i.e number of test cases. Each line of the test case contains a number  N i.e number of blocks. 

Output:

Each new line of the output contains only one single integer i.e Maximum height of staircase.

Constraints:

1<=T<=100

1<=N<=10^8

Example:

Input:

3
10
12
16

Output:

4
4
5

Explanation:

Test Case 1: the max height of the staircase that can be made from  12  blocks is 4. (A staircase of height 4 means sequence of 1,2,3,4 blocks to create a valid staircase.)

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

Contributor: Nisnat Singh
Author: Nishant_Singh


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.