【模拟】【USACO】Factorials

最新推荐文章于 2019-08-17 23:46:55 发布

liveas

最新推荐文章于 2019-08-17 23:46:55 发布

阅读量1.4k

点赞数

分类专栏：模拟 USACO 文章标签： integer output input file 任务存储

本文链接：https://blog.csdn.net/liveas/article/details/5793973

版权

USACO 同时被 2 个专栏收录

25 篇文章 0 订阅

订阅专栏

模拟

15 篇文章 0 订阅

订阅专栏

The factorial of an integer N, written N!, is the product of all the integers from 1 through N inclusive. The factorial quickly becomes very large: 13! is too large to store in a 32-bit integer on most computers, and 70! is too large for most floating-point variables. Your task is to find the rightmost non-zero digit of n!. For example, 5! = 1 * 2 * 3 * 4 * 5 = 120, so the rightmost non-zero digit of 5! is 2. Likewise, 7! = 1 * 2 * 3 * 4 * 5 * 6 * 7 = 5040, so the rightmost non-zero digit of 7! is 4.

PROGRAM NAME: fact4

INPUT FORMAT

A single positive integer N no larger than 4,220.

SAMPLE INPUT (file fact4.in)

OUTPUT FORMAT

A single line containing but a single digit: the right most non-zero digit of N! .

SAMPLE OUTPUT (file fact4.out)

 
 
描述
N的阶乘写作N!表示小于等于N的所有正整数的乘积。
阶乘会很快的变大，如13!就必须用32位整数类型来存储，70！即使用浮点数也存不下了。
你的任务是找到阶乘最后面的非零位。举个例子:
5!=1*2*3*4*5=120所以5!的最后面的非零位是2
7!=1*2*3*4*5*6*7=5040，所以最后面的非零位是4


[编辑]格式
PROGRAM NAME: fact4
INPUT FORMAT:
(file fact4.in)
共一行，一个整数不大于4,220的整数N。
OUTPUT FORMAT:
(file fact4.out)
共一行，输出N!最后面的非零位。

[编辑]SAMPLE INPUT
7


[编辑]SAMPLE OUTPUT
4
  
  
做了有4遍了。
/*
ID:sephiro5
LANG:C++
PROG:fact4
*/
#include <stdio.h>

unsigned long long ans,i;

int main()
{
    freopen("fact4.in","r",stdin);
    freopen("fact4.out","w",stdout);
    
    scanf("%I64d",&ans);
    
    for (i=ans-1;i>1;--i)
    {
        ans*=i;
        if (ans>10000000) ans=ans%10000000;
        while (ans%10==0) ans/=10;
    }
    
    printf("%d/n",ans%10);
    
    return 0;
}