• HDU 2674 N!Again


    N!Again

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3481    Accepted Submission(s): 1889

    Problem Description
    WhereIsHeroFrom:             Zty, what are you doing ?
    Zty:                                     I want to calculate N!......
    WhereIsHeroFrom:             So easy! How big N is ?
    Zty:                                    1 <=N <=1000000000000000000000000000000000000000000000…
    WhereIsHeroFrom:             Oh! You must be crazy! Are you Fa Shao?
    Zty:                                     No. I haven's finished my saying. I just said I want to calculate N! mod 2009


    Hint : 0! = 1, N! = N*(N-1)!
     
    Input
    Each line will contain one integer N(0 <= N<=10^9). Process to end of file.
     
    Output
    For each case, output N! mod 2009
     
    Sample Input
    4
    5
     
    Sample Output
    24
    120
     
    题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=2674
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 int main() 
     4 {
     5     int n;
     6     int ans,i;
     7     while(~scanf("%d",&n))
     8     {
     9         ans=1;
    10         if(n>=2009)
    11             printf("0
    ");
    12         else
    13         {
    14             for(i=1;i<=n;i++)    
    15             {
    16                 ans*=i;
    17                 ans%=2009;
    18             }
    19             printf("%d
    ",ans);    
    20         }
    21     }
    22     return 0;
    23 }
     
  • 相关阅读:
    [剑指offer] 42. 和为S的两个数字
    [剑指offer] 41. 和为S的连续正数序列
    datagridview bindingsource刷新数据
    datagridview bindingsource
    slot-具名插槽
    基于uniapp的ui库
    组件之间通讯
    vue实现word或pdf文档导出的功能
    Vue之富文本tinymce爬坑录
    12道vue高频原理面试题,你能答出几道?
  • 原文地址:https://www.cnblogs.com/yeshadow937/p/3927457.html
Copyright © 2020-2023  润新知