|
发表于 2017-6-6 00:47:05
|
显示全部楼层
本帖最后由 永恒的蓝色梦想 于 2020-7-2 18:20 编辑
- import math
- def Prime(x):
- if x > 1:
- if x == 2:
- return True
- if x % 2 == 0:
- return False
- for i in range(3, int(math.sqrt(x)+1), 2):
- if x % i == 0:
- return False
- return True
- def cycle(a):
- list1 = []
- while True:
- tmp = a
- i = 2
- while True:
- if Prime(i):
- if tmp % i == 0:
- if i not in list1:
- list1.append(i)
- tmp = tmp/i
- i = 2
- continue
- elif Prime(tmp) or tmp == 1:
- if tmp not in list1:
- if Prime(tmp):
- list1.append(tmp)
- return list1
- else:
- i += 1
- else:
- i += 1
- i = 2
- while True:
- if not Prime(i):
- if len(cycle(i)) == 4 and len(cycle(i+1)) == 4 and len(cycle(i+2)) == 4 and len(cycle(i+3)) == 4:
- print(i)
- break
- else:
- i += 1
- else:
- i += 1
复制代码 答案:134043 |
|