杭电ACM HDU 2674 N！Again

最新推荐文章于 2021-03-28 01:15:14 发布

gubojun

最新推荐文章于 2021-03-28 01:15:14 发布

阅读量1.7k

点赞数

分类专栏： ACM-hdoj 文章标签： HDU ACM 杭电 2674

本文链接：https://blog.csdn.net/gubojun123/article/details/8977968

版权

ACM-hdoj 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

N！Again

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

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

Source

HDU女生专场公开赛——谁说女子不如男

Recommend

lcy

#include<cstdio>
int main(){
    int n,s,i;
    while(~scanf("%d",&n)){
        if(n>41)
            printf("0\n");
        else{
            for(i=s=1;i<=n;i++){
                s*=i;
                s%=2009;
            }
            printf("%d\n",s);
        }
    }
}