L1-006 连续因子 - 团体程序设计天梯赛-练习集
from math import sqrt
arr = []
n = int(input())
a = []
le = []
def jisuan(n):for i in range(2,int(sqrt(n)) + 1):if n % i == 0:return ireturn n
for i in range(2,int(sqrt(n)) + 1):c = i + 1b = is = str(i)while n % (c * b) == 0:b = b * cs = s + '*' + str(c)c += 1a.append(b)arr.append(s)le.append(c - i)ans = 1
ans_arr = str(n)
for i in range(len(arr)):if n % a[i] == 0 and le[i] > ans:ans = le[i]ans_arr = arr[i]
if ans == 1:ans_arr = jisuan(n)
print(ans)
print(ans_arr)
