HDU 2674 N！Again [Ad Hoc]

Description

Algorithm

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;
}
}