Problem 3 Largest prime factor
来源:互联网 发布:java多线程并发执行 编辑:程序博客网 时间:2024/06/07 01:07
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
import mathdef is_prime(n): if n < 2:return False for i in range(2,int(math.sqrt(n))+1,1): if not n % i :return False return Truedef run(n): for i in range(3,int(math.sqrt(n))+1,2): if not is_prime(i):continue if n == i:return n if not n % i: n = n / iprint run(13195)print run(600851475143)
阅读全文
0 0
- Problem 3:Largest prime factor
- Problem 3 Largest prime factor
- Problem 3 of largest prime factor
- 【Project Euler】【Problem 3】Largest prime factor
- (Problem 3)Largest prime factor
- projecteuler---->problem=3----Largest prime factor
- Project Euler Problem 3: Largest prime factor
- ProjectEuler-Problem 3-Largest prime factor
- Problem 3 Largest prime factor (分解素因子)
- 2.1.3 Largest prime factor
- PE 3 Largest prime factor
- Project Euler -- 3 Largest prime factor
- 3 Largest prime factor - Project Euler
- HDU2136:Largest prime factor
- Largest prime factor
- Largest prime factor
- Largest prime factor
- hdoj Largest prime factor
- java集合--Iterator和Enumeration比较
- Xcode8 集成微信/支付宝sdk步骤及错误
- C# PDFbox读取PDF内容
- 初见蓝桥——历年试题 蚂蚁感冒
- Android httpclient如何让客户端提示服务器close连接
- Problem 3 Largest prime factor
- MySQL常用操作
- 数据结构——数组和广义表习题收集
- nginx
- 分针网——每日分享:Node.js 之 HTTP实现详细分析
- win10启用wifi
- Java包装类、File类、枚举类举例
- SSM项目中使用Redis缓存
- redis并发问题 && 分布式锁