Question

Shaktimaan has N chocolates in total. On the first day, he is allowed to eat max 1 chocolate. If he eats x chocolates on a given day, he can eat x,x+1 or X-1 chocolates on the next day. On the last day, he can't eat more than 1 chocolate. Help Shaktimaan by calculating the minimum number of days in which he can eat N chocolates. Input Format The first line contains an integer T (1sts1000) denoting the number of test cases. Each of the next T lines contains an integer N (1sNs 10%). Output Format Output T lines. On each line output the minimum number of days for each test case. Sample Input 3 4. 1 9 Sample Output 3 1 5​

Answer 1

Answer:

$\times {3 \times > 160xx1 {3 = \times \geqslant |?| }^{?} }^{2}$