joj1199

最新推荐文章于 2018-07-16 19:06:33 发布

原创最新推荐文章于 2018-07-16 19:06:33 发布 · 493 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

joj模拟题

1199: Just the Facts

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1164	435	Standard

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

Sample Output

This problem is used for contest: 106 157 192

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        int sum=1;
        for(int i=1;i<=n;i++)
        {
            sum=sum*i;
            while(sum%10==0)sum=sum/10;
            sum=sum%100000;//这里之所以不是/10是因为有能发生进位的情况。。。
        }
        while(sum%10==0)sum=sum/10;
        sum=sum%10;
        printf("%5d -> %d\n",n,sum);
    }
    return 0;
}

标签

#each #output #integer #input #2010