Project Euler -> problem 3
2013-08-22 15:33
344 查看
3.13195的质数因子有5,7,13和29。600851475143的最大质数因子是多少?
#include <math.h>
void MaxPrine(unsigned long long u);
int main(void)
{
unsigned long long
i=13195,u=600851475143;
MaxPrine(i);
MaxPrine(u);
return
0;
}
//求最大质因子算法
void MaxPrine(unsigned long long u)
{
unsigned long long i=0;
while(i<sqrt(u)){
for(i=2;i<sqrt(u);i++){
if(u%i ==
0){
u/=i;
break;
}
}
}
printf("The biggest prime
is:%lld\n",u);
}
#include <math.h>
void MaxPrine(unsigned long long u);
int main(void)
{
unsigned long long
i=13195,u=600851475143;
MaxPrine(i);
MaxPrine(u);
return
0;
}
//求最大质因子算法
void MaxPrine(unsigned long long u)
{
unsigned long long i=0;
while(i<sqrt(u)){
for(i=2;i<sqrt(u);i++){
if(u%i ==
0){
u/=i;
break;
}
}
}
printf("The biggest prime
is:%lld\n",u);
}
Answer: | 6857 |
相关文章推荐
- Project Euler -> problem 2
- Project Euler -> problem 4
- Project Euler -> problem 5
- Project Euler -> problem 6
- Project Euler -> problem 7
- Project Euler -> problem 8
- Project Euler -> problem 9
- Project Euler -> problem 12
- Project Euler -> problem 1
- Project Euler -> prob 4000 lem 11
- project euler Problem 18 & 36
- projecteuler---->problem=33----Digit canceling fractions
- Project Euler Problem 30
- ZOJ 3686 A Simple Tree Problem(将对树的操作转化成区间=>线段树)
-  |"|&|<|>等html字符转义
- The7th Zhejiang Provincial Collegiate Programming Contest->Problem A:A - Who is Older?
- Test11_6&nbsp;指针用p-&gt;X和(*p).X等价
- JSP 之 JSTL_04:<c:forTokens>
- Linux-world-2012-January->16(mini2440 uboot201103 系统移植)->3(machine ID problem)
- project euler Largest prime factor&Largest palindrome product