blob: 900c57ad2e24acabb9db2b8745e4b263e9323d2e (
plain)
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
|
/*
** ifactor.c -- print prime factorization of a number
**
** Ray Gardner -- 1985 -- public domain
*/
#include <stdio.h>
#include <stdlib.h>
int prevfact = 0;
void factor (long);
void show (long, int);
void main (int argc, char *argv[])
{
while ( --argc )
factor(atol(*++argv));
}
void factor (long n)
{
long d;
int k;
long n0 = n;
prevfact = 0;
printf("%ld ",n);
if ( n < 2 )
{
printf("is less than 2.\n");
return;
}
else if ( n > 2 )
{
d = 2;
for ( k = 0; n % d == 0; k++ )
n /= d;
if ( k )
show(d,k);
for ( d = 3; d * d <= n; d += 2 )
{
for ( k = 0; n % d == 0; k++ )
n /= d;
if ( k )
show(d,k);
}
}
if ( n > 1 )
{
if ( n == n0 )
printf(" is prime");
else show(n,1);
}
printf("\n");
}
void show (long d, int k)
{
if ( prevfact )
printf(" * ");
else printf(" = ");
prevfact++;
printf("%ld",d);
if ( k > 1 )
printf("^%d",k);
}
|
