Problem 3 Largest prime factor (分解素因子)
来源:互联网 发布:ios的编程框架 编辑:程序博客网 时间:2024/06/05 14:45
Largest prime factor
Problem 3
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
Answer:
6857题解:
Let the given number be n and let k = 2, 3, 4, 5, ... . For each k, if it is a factor of n then we divide n by k and completely divide out each k before moving to the next k. It can be seen that when k is a factor it will necessarily be prime, as all smaller factors have been removed, andthe final result of this process will be n = 1.
代码:
#include <bits/stdc++.h>using namespace std;long long num = 600851475143ll;int main(){long long i, max = 1;for(i = 2; i * i <= num; i++){if(num % i == 0){max = i;while(num % i == 0) num /= i;} if(num > 1) max = num;}cout<<max<<endl;return 0;}
1 0
- Problem 3 Largest prime factor (分解素因子)
- (Problem 3)Largest prime factor
- Problem 3:Largest prime factor
- Problem 3 Largest prime factor
- HDU 2136 Largest prime factor(最大素因子)
- Largest prime factor 最大素因子
- Largest prime factor(最大素数因子)
- Problem 3 of largest prime factor
- 【Project Euler】【Problem 3】Largest prime factor
- projecteuler---->problem=3----Largest prime factor
- Project Euler Problem 3: Largest prime factor
- ProjectEuler-Problem 3-Largest prime factor
- HDU Largest prime factor && nyoj 520 最大素因子【素数】
- 2.1.3 Largest prime factor
- PE 3 Largest prime factor
- hdu oj 2136 Largest prime factor 和 nyoj 520 最大素因子 【筛选法】
- HDU 2136 Largest prime factor (最大素因子序号,cin超时呀!!!)
- (hdu step 2.1.3)Largest prime factor(求一个数的最大质因子的位置)
- 关于eclipse启动报错An internal error occurred during: "reload maven project". java.lang.NullPointerExcepti
- Linux c==进程通信--有名管道(4)
- 数据结构实验之二叉树六:哈夫曼编码
- 【微信小程序】从入门到放弃
- JavaScript权威指南之闭包
- Problem 3 Largest prime factor (分解素因子)
- contentprovider的学习实例总结
- oracle中的分页
- contentprovider的学习实例总结(摘抄)
- 字符串笔试题
- NAND flash与NOR flash的区别
- 最近找回遗漏的C知识
- 平衡树 || Red-Black Tree
- 用mysql编写在BORROW表上建立一个触发器,完成将该读者的借阅记录保存在BORROW_SAVE表中。。