-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathfactorial.c
65 lines (57 loc) · 1.09 KB
/
factorial.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
#include <stdio.h>
#include <stdlib.h>
/**
* output:
* factorial(0) = 1
* factorial(1) = 1 = 1
* factorial(2) = 2 = 1 * 2
* factorial(3) = 6 = 1* 2 * 3
* factorial(4) = 24 = 1* 2 * 3 * 4
* factorial(5) = 120 = 1* 2 * 3 * 4 * 5
*/
int factorial(int n);
int printFactorial(int n);
int main()
{
int i, j;
int max, product;
max = 10;
for (i = 0; i <= max; i++)
{
product = 1;
for (j = 1; j <= i; j++)
{
product *= j;
}
printf("factorial(%d) = %3d \n", i, product);
}
printf("\n====");
for (i = 0; i <= max; i++)
{
printf("\n factorial(%d) = %3d = ", i, factorial(i));
printFactorial(i);
}
getchar();
return 0;
}
int printFactorial(int n)
{
int i;
for (i = 1; i <= n; i++)
{
printf("%d", i);
if (i < n)
printf(" * ");
}
return 0;
}
int factorial(int n)
{
int product, i;
product = 1;
for (i = 1; i <= n; i++)
{
product *= i;
}
return product;
}