Project Euler 3
来源:互联网 发布:美容护肤基础知识知乎 编辑:程序博客网 时间:2024/06/03 07:34
'''Created on 2014年8月23日Largest prime factorThe prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?@author: wxp2971'''from numpy import *# 直接求解,寻找最大的那个N = 600851475143factor = 2lastFactor = 1while N > 1: if N % factor == 0: lastFactor = factor while N % factor == 0: N = N / factor factor += 1print(lastFactor)# 对特殊的质数进行筛选N = 600851475143if N % 2 == 0 : N = N / 2 lastFactor = 2 while N % 2 == 0: N = N / 2else: lastFactor = 1factor = 3while N > 1: if N % factor == 0: N = N / factor lastFactor = factor while N % factor == 0: N = N / factor factor += 2print(lastFactor)# 质因子的最大不会超过sqrt(N)N = 600851475143if N % 2 == 0 : N = N / 2 lastFactor = 2 while N % 2 == 0: N = N / 2else: lastFactor = 1factor = 3maxFactor = sqrt(N)while N > 1 and factor <= maxFactor: if N % factor == 0: N = N / factor lastFactor = factor while N % factor == 0: N = N / factor maxFactor = sqrt(N) factor += 2if N == 1: print(lastFactor)else: print(int(N))
0 0
- Project Euler - Problem 3
- Project Euler problem 3
- project euler Problem 3
- Project Euler 3
- Project Euler - 3
- project euler 3
- Project Euler Problem 3
- Project Euler Question 3
- project euler 3
- Project Euler-3(素数问题)
- 【Project Euler】3 第三题
- Project Euler
- project euler
- Project Euler
- 【Project Euler】【Problem 3】Largest prime factor
- Project Euler -- 3 Largest prime factor
- Python计算Project Euler Problem 3
- 3 Largest prime factor - Project Euler
- Android客户端与服务端交互之登陆示例
- C++11 tuple
- 编辑距离算法
- Closest Common Ancestors - POJ 1470 LCA
- 64541541541
- Project Euler 3
- Box2D C++ 碰撞
- JAVA中堆栈和内存分配
- UVA 185 - Roman Numerals
- fork()函数浅析
- uva 1517 - Tracking RFIDs(STL+几何)
- spket IDE和eclipse插件的安装
- cocos2d-x 第一天IOS环境搭建
- 【索引】Fundamental Data Structures:Exercises: Intermediate