uva 568 Just the Facts

Just the Facts

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 any factorial for ( ). 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 not exceeding 10000, 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. Each line of output should contain the value  N , right-justified in columns 1 through 5 with leading blanks, not leading zeroes. Columns 6 - 9 must contain ``  ->  " (space hyphen greater space). Column 10 must contain the single last non-zero digit of  N !.

Sample Input 

1
2
26
125
3125
9999

Sample Output 

    1 -> 1
    2 -> 2
   26 -> 4
  125 -> 8
 3125 -> 2
 9999 -> 8

求n!的第一个非零数字。

方法：

n! = K * 10 ^ x = K * (2 * 5) ^ x = K * (2 ^ x) * (5  ^ x)

借鉴求n!的trailing - zero的个数的方法。先求出

n!中因子5的个数x，在n!除去5^x和2^x就得到K

K % 10 就得到last-nozero digit。

其中n!中的5的个数的求法为：x = [n/5] + [n/5^2] + [n/5^3] + ......+[n/5^k],其中  5^k <= n <= 5^(k+1).

代码：

#include <stdio.h>
int num_of_zero(int n)
{
    int s, k;
    k = 5;
    s = 0;
    while(n >= k){
        s += n / k;
        k *= 5;
    }
    return s;
}
int last_nozero_digit(int n)
{
    int s, i, t, r;
    s = num_of_zero(n);
    r = 1;
    for(i = 2; i <= n; i++){
        t = i;
        while(t % 5 == 0)
            t /= 5;
        while(s > 0 && (t & 1) == 0){
            t >>= 1;
            s--;
        }
        r = (r * t) % 10;
    }
    return r;
}
int main()
{
    int n;
    while(scanf("%d", &n) != EOF){
        printf("%5d -> %d\n", n, last_nozero_digit(n));
    }
    return 0;
}