当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1066:Last non-zero Digit in N!

题目描述
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 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!.
输出解释
For each integer input, the program should print exactly one line of output containing the single last non-zero digit of N!.
输入样例
1 
2 
26 
125 
3125 
9999
输出样例
1
2
4
8
2
8
来自杭电HDUOJ的附加信息
Recommend JGShining

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 South Central USA 1997

源链接: HDU-1066

最后修改于 2020-10-25T22:41:52+00:00 由爬虫自动更新

共提交 2

通过率 0.0%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)