python蓝桥杯最大最小公倍数

在idle运行不到一秒时间，但是把代码放到蓝桥杯的oj系统中就判断为超时

def dota(a,b,c):

    
  
    dk=[a,b,c]
    if 1 in dk:
        qop=a*b*c
    else:
        s=[]
        k=2
            
        while True:
          
            while a%k!=0 or b%k!=0 or c%k!=0:
                k+=1
                if k>min([a,b,c]):
                    break
            if k>min([a,b,c]):
                    break
            
            a=a/k
            b=a/k
            c=a/k
            s.append(k)



        jugg=1
        for i in s:
            jugg=jugg*i
        qop=a*b*c*jugg    
        qop=int(qop)
        
    return qop 
N=int(input())
dog=[]

for i in range(1,N+1):
    jk=list(range(1,N+1))
    jk.remove(i)
    for j in jk:
        dk=list(range(1,N+1))
        dk.remove(i)
        dk.remove(j)
        for k in dk:
            dog.append([i,j,k])
            
k=[]
for i in dog:
    a=dota(i[0],i[1],i[2])
    k.append(a)
print(max(k))