Card constructions -- two points

Card Constructions
https://codeforces.com/problemset/problem/1345/B
< Ideas >
Dichotomy h

from sys import stdin

def binary_search(val):
    i, j = 1, 100000
    while i < j:
        mid = i + (j - i) / 2
        mid = int(mid)
        ptr = (3 * mid * mid + mid) // 2
        if ptr <= val:
            i = mid + 1
        else:
            j = mid
    return i - 1

t = int(stdin.readline())
for _ in range(t):
    n = int(stdin.readline())
    ans = 0
    tmp = n

    while(True):
        ans = ans + 1
        h = binary_search(tmp)
        if h == 0:
            break
        tmp = tmp - (3 * h * h + h) // 2

    print(ans - 1)