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,
Just the Facts |
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 lastnon-zero digit of anyfactorial for (). For example, if your program is asked tocompute the last nonzerodigit 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 linewith no other letters, digits or spaces. For each integer N, you shouldread the value and compute the last nonzero digit of N!.Output
For each integer input, the program should print exactly one line ofoutput. Each line of outputshould contain the value N, right-justified in columns 1 through 5 withleading blanks, not leadingzeroes. 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
Miguel A. Revilla
1998-03-10
这题大意就是要求求出N阶乘的非零尾数,由于阶乘着中的尾0都是由2和5生成的,所以通过循环,先将含有2和5的因子都将2和5除尽,并标记被除去的2和5的数目,而由于2和5已除尽,所以仅需不断的乘上因子再对10取余即可。之后再比较2和5的数量,将多余的2或5乘上,同样取余,最后将结果输出。
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
long long n;
while (cin >> n) {
int num2 = 0;
int num5 = 0;
int sum = 1;
for (int i = 1; i <= n; i++) {
int tmp = i;
while (tmp % 2 == 0) {
tmp /= 2;
num2++;
}
while (tmp % 5 == 0) {
tmp /= 5;
num5++;
}
sum *= tmp;
sum %= 10;
}
if (num2 > num5) {
for (int i = 0; i < num2 - num5; i++) {
sum *= 2;
sum %= 10;
}
}
if (num2 < num5) {
for (int i = 0; i < num5 - num2; i++) {
sum *= 5;
sum %= 10;
}
}
printf("%5lld -> %d\n",n,sum);
}
return 0;
}