-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathquestion24.c
55 lines (45 loc) · 864 Bytes
/
question24.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
/*
http://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <math.h>
int multiply(int num, int *arr, int size){
int i;
int carry = 0;
for(i=0;i<size;i++){
int prod = num*arr[i] + carry;
arr[i] = prod%10;
carry = prod/10;
}
while(carry){
arr[size] = carry%10;
size++;
carry = carry/10;
}
return size;
}
void fact(int n){
int arr[3000];
int size = 1;
arr[0] = 1;
int i;
for(i=2; i<=n;i++){
size = multiply(i,arr,size);
}
for(i=size-1;i>=0;i--){
printf("%d", arr[i]);
}
printf("\n");
}
int main(){
int cases,i;
scanf("%d",&cases);
for(i=0;i<cases;i++){
int n;
scanf("%d",&n);
fact(n);
}
return 0;
}