Euler project3: the largest prime factor
来源:互联网 发布:之知为知之不知为不知 编辑:程序博客网 时间:2024/06/07 09:04
问题描述:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
C++:
#include<bits/stdc++.h>using namespace std;int main(){ long long n,ans=2; cin>>n; long long q=(long long)sqrt(n*1.0); long long i=2; /* * 若正整数a>1,且a不能被不超过a的平方根的任一素数整除, * 则a是素数 */ while(i <= q && n > 1) { while(n % i == 0) { n /= i; ans=max(ans,i); //cout<<ans<<endl; } i++; } cout<<ans<<endl; return 0;}
阅读全文
1 0
- Euler project3: the largest prime factor
- 【Project Euler】【Problem 3】Largest prime factor
- Project Euler -- 3 Largest prime factor
- 3 Largest prime factor - Project Euler
- Project Euler 003 Largest prime factor
- Project Euler Problem 3: Largest prime factor
- project euler Largest prime factor&Largest palindrome product
- HDU2136:Largest prime factor
- Largest prime factor
- Largest prime factor
- Largest prime factor
- hdoj Largest prime factor
- hdu Largest prime factor
- Largest prime factor 2136
- Largest prime factor
- Largest prime factor
- HDU2136 Largest prime factor
- hdoj Largest prime factor
- 变量与函数的综合示例
- is already under version control svn——两种方法
- Oracle监听状态查看
- SAX解析XML
- js利用数组做省级联动
- Euler project3: the largest prime factor
- Redis持久化介绍
- vue-resource 踩坑记
- Java NIO学习(三)Selector监听事件+NIO服务器实例
- 小白笔记----------------leetcode 58. Length of Last Word
- Codeforces Round #339 (Div. 2)C. Peter and Snow Blower(几何模板)
- AOP采用Annotation声明方式
- linux基本权限--权限对文件,目录作用说明
- 线程