-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3.c
72 lines (65 loc) · 1.24 KB
/
3.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*************************************************************************
> File Name: 3.c
> Author: qusijun
> Mail: [email protected]
> Created Time: 2014年05月04日 星期日 20时20分13秒
************************************************************************/
#include<stdio.h>
#include<math.h>
#define LIMIT 1000
int is_prime[LIMIT];
void prime();
long max_factor(long long );
int main(void)
{
//prime();
long long n = 600851475143;
long result = max_factor(n);
printf("%li",result);
return 0;
}
void prime(void)
{
for(int i = 0;i<LIMIT;i++)
{
is_prime[i] = 1;
}
for(long long i = 2;i<sqrt(LIMIT);i++)
{
if(is_prime[i])
{
long long n = i+i;
while(n<=LIMIT)
{
is_prime[n] = 0;
n+=i;
}
}
}
for(long long i = 1;i<LIMIT;i++)
{
if(is_prime[i])
{
printf("%lld,",i);
}
}
}
long max_factor(long long num)
{
long i,max;
max = 0;
while(num !=1)
{
i = 2;
while(num%i != 0)
{
i++;
}
if(max<i)
{
max = i;
}
num/=i;
}
return max;
}