Задача на рекурсию 2

def check(x,r,step):
    if (x>r) or (step > 6):
        return False
    if (x==r):
        return True    
    a1=check(x+1,r,step+1)
    a2=check(x+2,r,step+1)
    a3=check(x*2,r,step+1)
    return a1 or a2 or a3
 
count = 0
def task_2(n1,n2):
    global count
    for x in range(n1,n2+1):
        if check(1,x,0) != 0: count += 1
 
task_2(34,59)
print(count)

def check(x,r,step):
    if (x>r) or (step > 7):
        return False
    if (x==r):
        return True    
    a1=check(x+1,r,step+1)
    a2=check(x+5,r,step+1)
    a3=check(x*3,r,step+1)
    return a1 or a2 or a3
 
count = 0
def task_2(n1,n2):
    global count
    for x in range(n1,n2+1):
        if check(1,x,0) != 0: count += 1
 
task_2(1,10000)
print(count)

def func(s,x,l):
    if x < s or l < 0: return 0
    if x == s: return 1
    K = func(s,x-1,l-1)
    K += func(s,x-5,l-1)
    if x % 3 == 0:
        K += func(s,x//3,l-1)
    return K
 
count = 0
for i in range(1,10000):
    if func(1,i,7) != 0: count += 1
print(count)

def next_cmd(x,step,res=[]):
    if step==7:
        return res+[x]
    s1=next_cmd(x+1,step+1,res)
    s2=next_cmd(x+5,step+1,res)
    s3=next_cmd(x*3,step+1,res)
    return s1+s2+s3
    
def task():
    r=next_cmd(1,0,[])
    return len(list(set(r)))
    
print(task())

def f(nc, kc, step):
    if nc > kc or step > 6:
        return 0
    if nc == kc:
        return 1 
    if nc < kc:
        return f(nc + 1, kc, step + 1) + f(nc + 2, kc, step + 1) + f(nc * 2, kc, step + 1)
 
k = 0
nc = 1
step = 0
for kc in range(34, 60):
    if f(nc, kc, step):
        k += 1
print(k)