HDU 2802 F(N)

F(N)

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4531    Accepted Submission(s): 1585

Problem Description

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

HDU 2009-4 Programming Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   2807  2804  2800  2806  2808 

打表法找出循环节，一个新的技巧。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
__int64 f[110000];
void  init()
{
	int i;
	f[1]=1;
	f[2]=7;
	for(i=3;i<=5000;i++)
	f[i]=(f[i-2]+3*i*i-3*i+1)%2009;
}
int main()
{
	__int64 n,i;
	init();
	while(scanf("%I64d",&n),n)
	{
		//for(i=3;i<=110000;i=i+2)打表法找出循环节 
		//if(f[i]==1)
		//break;
		//printf("%I64d\n",i-1);
		//for(i=4;i<=110000;i=i+2)
		//if(f[i]==7)
		//break;
		//printf("%I64d\n",i-2);
	    //printf("%I64d\n",f[4018]);
		printf("%I64d\n",f[n%4018]);
	}
	return 0;
}