hdu2674 N！Again

最新推荐文章于 2021-08-06 19:31:49 发布

my1995

最新推荐文章于 2021-08-06 19:31:49 发布

阅读量354

点赞数

分类专栏：水题集文章标签： ACM

本文链接：https://blog.csdn.net/my1995/article/details/38080703

版权

水题集专栏收录该内容

5 篇文章 0 订阅

订阅专栏

N！Again

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

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

Sample Output

Author

WhereIsHeroFrom

题解：对2009分解，看它有哪些质因子，它最大的质因子是41，那么对于大于等于41的数，直接输出0就行了。

代码：

这是一道水题

#include<iostream>
using namespace std;
#include<cstdio>
int n,i;
int a[105];
int main()
{
    a[0]=1;
    a[1]=1;
    for(i=2;i<=41;i++)
    {
        a[i]=a[i-1]*i;
        a[i]=a[i]%2009;
    }
    while(~scanf("%d",&n))
    {
       if(n>=41)
        printf("0\n");
       else
        printf("%d\n",a[n]);
    }
    return 0;
}