HDU-1066 Last non-zero Digit in N!

Last non-zero Digit in N!

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)

Problem Description

The expression $N!$, read as “N factorial,” denotes the product of the first $N$ positive integers, where $N$ is nonnegative. So, for example,

$N$	$N!$
$0$	$1$
$1$	$1$
$2$	$2$
$3$	$6$
$4$	$24$
$5$	$120$
$10$	$3628800$

For this problem, you are to write a program that can compute the last non-zero digit of the factorial for $N$. For example, if your program is asked to compute the last nonzero digit of $5!$, your program should produce "2" because $5!=120$, and $2$ is the last nonzero digit of $120$.

Input

Input to the program is a series of nonnegative integers, each on its own line with no other letters, digits or spaces. For each integer $N$, you should read the value and compute the last nonzero digit of $N!$.

Output

For each integer input, the program should print exactly one line of output containing the single last non-zero digit of $N!$.

Sample Input

1 
2 
26 
125 
3125 
9999

Sample Output

1
2
4
8
2
8

Reference Code

#include <cstdio>
#include <cstring>
const int MAXN = 1e3 + 10;
int lst[] = {1, 1, 2, 6, 4, 2, 2, 4, 2, 8};
int lst1[] = {3, 3, 0, 3, 1, 1, 1, 2, 1, 3};
int lst2[] = {2, 4, 8, 6};
int num[MAXN], len;
char str[MAXN];
int solve(){
    if (len == 1) return lst[num[0]];
    int tail = num[0], c = 0;
    for (int i = len - 1; i >= 0; i--){
        c = c * 10 + num[i];
        num[i] = c / 5;
        c %= 5;
    }
    while (!num[len-1]) len--;
    int k = (num[1] * 10 + num[0]) & 3;
    return lst2[(lst1[tail] - k + 4) & 3] * solve() % 10;
}
int main(){
    while (~scanf("%s",str)){
        len = strlen(str);
        for (int i = 0; i < len; i++)
            num[i] = str[len - i - 1] - '0';
        printf("%d\n",solve());
    }
}

Tips

设$g(n)$为$n$最后一个不是$0$的数字，易证，如果$g(a),g(b)̸=5$，有$g(ab)=g\left(g(a)g(b)\right)$。
因此，我们可以把$n!$分解为$$n!=l\times \prod _{i=1}^{k}5i\times 2^k=l\times k!\times 10^k\text{\hspace{1em}(*)}$$其中$k=\lfloor \frac{n}{5}\rfloor$，然后利用$$g(n!)=g\left(g(l)g(k!)\right)$$递归地求解本题。

下面，我们分两步求解$g(l)$。

首先，将$(\ast )$式两边同除${\prod }_{i=1}^{k}5i\times 2^k$，我们得出$$l=\frac{1}{2^k}\left(\prod _{i=0}^{\lfloor \frac{n}{10}\rfloor -1}\prod _{1⩽j⩽9,j̸=5}(10i+j)\cdot \prod _{1⩽i⩽m,i̸=5}\left(10\lfloor \frac{n}{10}\rfloor +i\right)\right)=\frac{h}{2^k}$$

其中$m=n\text{ mod }10$。

我们先求解$g(h)$。

不难发现，若有$5\nmid t_i,\forall 1⩽i⩽s$，则$$g\left(\prod _{i=1}^s{t}_i\right)=g\left(\prod _{i=1}^s(t_i\text{ mod }10)\right)$$

因此，$$g\left(\prod _{i=0}^{\lfloor \frac{n}{10}\rfloor -1}\prod _{1⩽j⩽9,j̸=5}(10i+j)\right)=g\left({\left(\prod _{1⩽j⩽9,j̸=5}j\right)}^{\lfloor \frac{n}{10}\rfloor }\right)=6$$$$g\left(\prod _{1⩽i⩽m,i̸=5}\left(10\lfloor \frac{n}{10}\rfloor +i\right)\right)=g\left(\prod _{1⩽i⩽m,i̸=5}i\right)$$所以 $g(h)$ 只和 $m$ 有关，我们可以打表解决，而 g ( h ) ∈ { 2 , 4 , 6 , 8 } g(h)\in\{2,4,6,8\} g(h)∈{2,4,6,8} ，所以，可以用一张表格记录 $g(h)$ 在数组 lst[]={2,4,8,6} 中的下标即可（至于为什么是2486而不是2468可以联系下一段来看），具体为 lst1[]={3,3,0,3,1,1,1,2,1,3} 。

然后我们求解 $g(l)=g(h/2^k)=g(\text{lst}[\text{lst1}[m]]/2^k)$ 。

因为 $2^k$ 是以 {2,4,8,6} 为循环节的，所以我们只要将 lst1[m] 减去 $k$ 再模 $4$ ，就得到 $g(l)$ 在数组 lst 中的下标了。此外，模 $4$ 的时候还可以利用 $x\text{ mod }4=(x\text{ mod }100)\text{ mod }4$ 和 n%4 $=$ n&3 来提高速度。

至于 $g(k!)$ 的递归，我们可以再制作一张表格，对应于 $0$ 到 $10$ 的阶乘末尾数字，当递归到 $k<10$ 时打表即可，表格为 {1,1,2,6,4,2,2,4,2,8} 。