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
73
74
75
76
77
78
79
80
|
/*
** factor.c -- print prime factorization of a number
** Ray Gardner -- 1985 -- public domain
** Modified Feb. 1989 by Thad Smith > public domain
**
** This version takes numbers up to the limits of double precision.
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int prevfact = 0;
void factor (double);
void show (double, int);
void main (int argc, char *argv[])
{
while ( --argc )
factor(atof(*++argv));
}
void factor (double n)
{
double d;
int k;
prevfact = 0;
d = n+1; /* test for roundoff error */
if (n+3 != d+2)
{
printf("%0.0f is too large to process.\n", n);
return;
}
if (fmod(n,1.) != 0.0)
{
printf("%f is not an integer.\n",n);
return;
}
printf("%0.0f ",n);
if ( n < 2. )
{
printf("is less than 2.\n");
return;
}
else if ( n > 2. )
{
d = 2;
for ( k = 0; fmod(n,d) == 0.0; k++ )
n /= d;
if ( k )
show(d,k);
for ( d = 3; d * d <= n; d += 2 )
{
for ( k = 0; fmod(n,d) == 0.0; k++ )
n /= d;
if ( k )
show(d,k);
}
}
if ( n > 1 )
{
if ( ! prevfact )
printf(" is prime");
else show(n,1);
}
printf("\n");
}
void show (double d, int k)
{
if ( prevfact )
printf(" * ");
else printf(" = ");
prevfact++;
printf("%0.0f",d);
if ( k > 1 )
printf("^%d",k);
}
|
