HDU 2674 D - N！Again

Problem Description
WhereIsHeroFrom: Zty, what are you doing ?
Zty: I want to calculate N!..
WhereIsHeroFrom: So easy! How big N is ?
Zty: 1 <=N <=1000000000000000000000000000000000000000000000…
WhereIsHeroFrom: Oh! You must be crazy! Are you Fa Shao?
Zty: No. I haven’s finished my saying. I just said I want to calculate N! mod 2009

#include <iostream>
#include <stdlib.h>
using namespace std;
const int N  = 2009;
int res[10000];				//至少要开到2010， 如果开到2019， 那么只能访问到2018， 访问到2018则越界 
void init(){
	res[0] = res[1] = 1;
	for (long long i = 2; i <= N; i++)
        res[i] = (res[i-1]*i)%N;
}
int main()
{
    init();
    long long n;             //int 类型也可以过， 但如果是long long类型，一定注意读入是%lld 
    while (~scanf("%lld", &n)){
        if (n <= 2009)			
            cout << res[n] << endl;
        else				//n！=n*（n-1）！ 2019！ = 2019*（2018！）  2019！%2019 = （（2019%2019）*（2018！%2019））%2019， 2019%2019 = 0； 
            cout << "0" <<endl;
    }

	return 0;
}