High-precision algorithms

Links: Https://www.nowcoder.com/acm/contest/75/E
Source: Niu Ke Net

Topic Description Given an integer n (0≤n≤10000), the factorial input description of n is obtained:

Multiple test data, each test data input a number n

Output Description:

Each group outputs the factorial of N with one line

Example 1 input

123

Output

126

#include <stdio.h> #include <string.h>int a[50000]; int main () {    int n;    while (~SCANF ("%d", &n)) {        memset (a, 0, sizeof (a));        A[0]=1; A[1]=1;        for (int i=1;i<=n;i++) {for            (int j=1;j<=a[0];j++)                a[j]=a[j]*i;            Int J;            for (j=1;j<=a[0];j++) {                a[j+1]=a[j+1]+a[j]/10;                a[j]=a[j]%10;            }            while (a[j]>0) {                a[j+1]+=a[j]/10;                A[J]%=10;                j + +;                a[0]++;            }        }        for (int i=a[0];i>0;i--)            printf ("%d", A[i]);        printf ("\ n");    }     return 0;}

Save each bit with an array and carry the previous one plus.

High-precision algorithms