For this Question: Given two positive integers B and A, find the smallest integer height such that there exists a Triangle with base B and area atleast A.The first line of input contains a single integer T, denoting the number of testcases. Each test case contains only one line i.e. B(base) and A(area) separated by space.

Constraints:
1 <= T <= 10
1 <= B <= 100000
1 <= A <= 100000For each testcase in new line you need to print the minimum height of triangle with base B and area atleast A.Input:
2
2 2
17 100

Output:
2
12, I have written this Solution Code: import math
def minheight(B,A):
    h=(2*A)/B
    return math.ceil(h)

T=int(input())
for i in range(T):

    B,A=map(int,input().split())
    print(minheight(B,A)), In this Programming Language: Python, Now tell me if this Code is compilable or not?