1 2 3 0
1 7 20
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<stdlib.h>
using namespace std;
typedef long long LL;
const LL MOD = 2009;
LL f[4050];
void init()
{
f[1] = 1; f[2] = 7;
for(LL i = 3;i <= 4018;i++)
{
f[i] = (f[i-2]%MOD+(((i*i*i)%MOD-((i-1)*(i-1)*(i-1))%MOD)+MOD)%MOD)%MOD;
}
}//4018是循环节 4018^3 = 64,867,893,832超int所以用long long
int main()
{
init();
int N;
while(scanf("%d",&N)&&N)
{
N = N%4018;
printf("%d\n",f[N]);
}
return 0;
}
原文地址：http://blog.csdn.net/demonstrate8/article/details/38751185
