hdu 2674 N!Again
2016-02-19 09:00
423 查看
#include<cstdio> #include<iostream> using namespace std; int main() { long long n,i,sum; while( scanf("%lld",&n)!=EOF ) { if(n==0) { printf("1\n"); continue; } if(n>=2009) { printf("0\n"); continue; } sum=1; for(i=1;i<=n;i++) { sum=( sum*i )%2009; } printf("%lld\n",sum); } return 0; }
相关文章推荐
- 对话DeepMind创始人:建立通用人工智能
- A. Again Twenty Five
- 签名APK后仍然出现INSTALL_PARSE_FAILED_NO_CERTIFICATES的解决方案
- HDU 3394 Railway 点双连通分量
- HDU 4300 Clairewd’s message
- 用find_if查找vector内对象的成员 http://blog.csdn.net/zhongguoren666/article/details/7629610
- STL中的find_if函数 http://blog.csdn.net/hj490134273/article/details/6051080
- sendEmail:出现的错误
- 1090. Highest Price in Supply Chain (25)
- HDU 5293 Tree chain problem - 树形dp&树状数组优化
- zabbix使用sendEmail发送告警邮件
- Organize Your Train part II POJ 3007 (哈希&链式解决冲突)
- C/C++程序中的profile http://blog.csdn.net/cnjet/article/details/2617403
- 11. Container With Most Water
- aidl引用类作为函数的返回值
- INSTALL_FAILED_OLDER_SDK
- grails一对一关联关系
- GDAL应用-gdal_merge.py
- ORA-00245: control file backup failed; target is likely on a local file system
- DataIntegration windows7 64 安装