HDU 2674 N!Again [Ad Hoc]
2016-03-04 17:56
471 查看
Description
求N! mod 2009Algorithm
超过2009肯定是0 然后前面2009的算下Code
#include <iostream> using namespace std; const int maxn = 2009; int main() { int n; int a[maxn] = {1}; for (int i = 1; i < maxn; i++) a[i] = (a[i - 1] * i) % maxn; while (cin >> n) { int ans; if (n >= maxn) ans = 0; else ans = a ; cout << ans << endl; } }
相关文章推荐
- retain、strong、weak、assign区别
- Git配置全局和独立仓库的username和email配置
- 进阶篇:以IL为剑,直指async/await
- 使用WebDriverWait类处理等待(sleep)的问题
- HDOJ-1789 Doing Homework again
- 使用AFN 的POST请求出现错误"Error Domain=NSCocoaErrorDomain Code=3840 "决绝方案
- HDU 3356 ||POJ 3996Air Strike(贪心)
- hdu 4630 No Pain No Game 线段树离线处理
- pthread_cond_wait()与pthread_cond_signal()
- quartz报错:SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder". SLF4J: Defaulting to no-op
- Forcing the Removal of a Domain Controller
- Thread 常搞混的几个概念sleep、wait、yield、interrupt
- 打造你的办公环境-email篇
- 【什么是长尾关键词(Long Tail Keyword)】
- 在mac上用Xcode写程序, run的时候总是失败, 显示clang: error: linker command failed with exit code 1
- How To Reclaim Wasted Space on The Segment (Table, Index and LOB) and Tablespace Levels (文档 ID 16827
- 怎样用好ZBrush中的PaintStop插件
- At least one JAR was scanned for TLDs yet contained no TLDs. Enable debug logging for 。。。
- hair gene (news)
- 软件RAID5项目实战!!!