Equilateral numbers

def eqnum(k):
    if k % 2 == 1:
        return k*((k+1)//2)
    else:
        return (k//2)*(k+1)
# print(eqnum(120000), 10**12)
# exit()
def binsearch(n, k0, k1):
    mid = (k0 + k1) // 2
    e = eqnum(mid)
    # print(n, k0, k1, e)
    if e == n:
        return mid
    elif k0 >= k1:
        if e > n:
            return k1-1
        else:
            return k1
    elif e > n:
        return binsearch(n, k0, mid-1)
    else:
        return binsearch(n, mid+1, k1)
 
n0 = int(input())
others = [([], 10**13, n0, 0)]
completed = []
while len(others):
    nums, k, n, c = others[0]
    others = others[1:]
    while(n):
        e = eqnum(k)
        e2 = eqnum(k-1)
        if e2 >= 1 and 2*e2 <= n:
            nums2 = [x for x in nums]
            nums2.append(e2)
            nums2.append(e2)
            others.append([nums2, k-1, n-e2*2, c+2])
        if e <= n:
            c += 1
            n -= e
            nums.append(e)
        else:
            k = binsearch(n,1,k)
    completed.append(nums)
mc = 10**12
mp = []
for c in completed:
    if len(c) < mc:
        mp = c
        mc = len(c)
print(len(c))
# print(c, sum(nums), nums)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER