F(N)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4904 Accepted Submission(s): 1735
Problem Description
![](https://i-blog.csdnimg.cn/blog_migrate/35dc4816379b4108bfd19fb70d2932dc.gif)
Giving the N, can you tell me the answer of F(N)?
Input
Each test case contains a single integer N(1<=N<=10^9). The input is terminated by a set starting with N = 0. This set should not be processed.
Output
For each test case, output on a line the value of the F(N)%2009.
Sample Input
1 2 3 0
Sample Output
1 7 20
Source
打个表,找找规律。。。4018一次循环
#include<stdio.h>
int f[6000];
int main()
{ f[1]=1;
f[2]=7;
for(int i=3;i<4020;i++)
{
f[i]=f[i-2]+3*i*i-3*i+1;
f[i]%=2009;
}
int n;
while(scanf("%d",&n),n)
{
printf("%d\n",f[n%4018]);
}
}