Last non-zero Digit in N!(阶乘最后非0位)


Last non-zero Digit in N!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5861 Accepted Submission(s): 1451

Problem 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 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
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!.
Output
For each integer input, the program should print exactly one line of output containing the single last non-zero digit of N!.
Sample Input
1
2
26
125
3125
9999
Sample Output
1
2
4
8
2
8
Source
South Central USA 1997
 1 #include <iostream>
 2 #include <string.h>
 3 #include <stdio.h>
 4 #include <stdlib.h>
 5 #define MAXN 10000
 6 
 7 int lastdigit(char* buf){
 8     const int mod[20]={1,1,2,6,4,2,2,4,2,8,4,4,8,4,6,8,8,6,8,2};
 9     int len=strlen(buf),a[MAXN],i,c,ret=1;
10     if (len==1)
11         return mod[buf[0]-'0'];
12     for (i=0;i<len;i++)
13         a[i]=buf[len-1-i]-'0';
14     for (;len;len-=!a[len-1]){
15         ret=ret*mod[a[1]%2*10+a[0]]%5;
16         for (c=0,i=len-1;i>=0;i--)
17             c=c*10+a[i],a[i]=c/5,c%=5;
18     }
19     return ret+ret%2*5;
20 }
21 int main()
22 {
23     char a[1000]="\0";
24     while(scanf("%s",a)!=EOF)
25     {
26         int ans=lastdigit(a);
27         printf("%d\n",ans);
28     }
29     return 0;
30 }

优质内容筛选与推荐>>
1、【框架】Spring和dubbox
2、[OPENSSL下载][证书] OPENSSL将PFX证书转换为PEM格式
3、PCAP 文件内容解析命令
4、openstack上传镜像
5、【转帖】intel 2018年1 月2号爆出漏洞分析 知乎匿名用户


长按二维码向我转账

受苹果公司新规定影响,微信 iOS 版的赞赏功能被关闭,可通过二维码转账支持公众号。

    阅读
    好看
    已推荐到看一看
    你的朋友可以在“发现”-“看一看”看到你认为好看的文章。
    已取消,“好看”想法已同步删除
    已推荐到看一看 和朋友分享想法
    最多200字,当前共 发送

    已发送

    朋友将在看一看看到

    确定
    分享你的想法...
    取消

    分享想法到看一看

    确定
    最多200字,当前共

    发送中

    网络异常,请稍后重试

    微信扫一扫
    关注该公众号





    联系我们

    欢迎来到TinyMind。

    关于TinyMind的内容或商务合作、网站建议,举报不良信息等均可联系我们。

    TinyMind客服邮箱:support@tinymind.net.cn