HDU 2674 N！Again [Ad Hoc]

原创于 2016-03-04 17:56:35 发布 · 431 阅读

0 ·

CC 4.0 BY-SA版权

Description

求N! mod 2009

Algorithm

超过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[n];
    cout << ans << endl;
  }
}