poj1604Just the Facts（数论）

Just the Facts

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8478		Accepted: 4483

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 any factorial for (0 <= N <= 10000). 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

每次保留最后5位计算就可以啦。。因为5^6>10000>5^5，所以乘一次最多带来5个零。

#include <iostream>
#include <iomanip>
using namespace std;
const int MAXN = 10005;
int ans[MAXN];
void get_ans(){
    int i=2,j=1;
    ans[1]=1;
    for(; i<=10000; i++){
        j*=i;
        while(j%10==0) j/=10;
        j%=100000; 
        ans[i]=j%10;
    }
}
int main()
{
    int n;
    get_ans();
    while(cin>>n && n){
        cout<<setw(5)<<n<<" -> "<<ans[n]<<endl;
    }
    return 0;
}