取模时如果模较小时可以找规律,因为它的余数有限
#include <iostream>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
long long res = 1;
if(n > 41)
{
cout << "0" << endl;
continue;
}
for(int i = 1 ; i <= n ;i ++ )
{
res *= i;
res %= 2009;
}
cout << res <<endl;
}
}