如何减小python中for循环的范围?

In this 问题我想找到min(m+k)使得mCk=n,我为我的序列编写了一段暴力破解的代码,问题是我的代码不够快,所以我想减少for循环的长度 k 进步

import math
print("the input is the maximum number $n$ to check for i.e for all u between 1, n the code gives the min m+k suck that mCk =n , the output is in the for of $(n , min (m+k : mCk=n)) $")
u=int(input())
for n in range (2,u+1):
    C=[]
    stop=1
    l=0
    for m in range (1, n+1):
        s=0
        if stop==-1:
            break
        for k in range(1, math.floor(m/2)+1-l):
            if math.comb(m,k)>n:
                l=l+1
                break
            if math.comb(m,k)==n:
                C.insert(s,m+k )
                s=s+1
                if min(C)<n+1:
                    stop=-1
                    break                      
    print(f"({n},{min(C)}), ")                               

这些是代码给出的第一个初始值: ( 2, 3), ( 3, 4), ( 4, 5), ( 5, 6), ( 6, 6) , ( 7, 8), ( 8, 9), ( 9, 10), ( 10, 7) , ( 11, 12), ( 12, 13), ( 13, 14), ( 14, 15), ( 15, 8) , ( 16, 17), ( 17, 18), ( 18, 19), ( 19, 20), ( 20, 9) , ( 21, 9) , ( 22, 23), ( 23, 24), ( 24, 25), ( 25, 26), ( 26, 27), ( 27, 28), ( 28, 10) , ( 29, 30), ( 30, 31), ( 31, 32), ( 32, 33), ( 33, 34), ( 34, 35), ( 35, 10)

问题是写这样的东西:

k=0
for i in range (0,100-k+1):
    if i%2==0
        k=k+1

不会减少范围的长度,这是我需要用代码做的

我试图寻找这个问题的解决方案,但只发现了无关的堆栈溢出问题。