10151

Recurrence Relations

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 710, Accepted users: 681

Problem 10151 : No special judgement

Problem description

Recurrence relations are where a function is defined in terms of itself and maybe other functions as well. in this problem, we have two functions of interest: F (N) = F (N - 1) + G (N - 1) ; F (1) = 1 G (N) = G (N - 1) + G (N - 3) ; G (1) = 1, G (2) = 0, G (3) = 1 For a given value of N, compute F (N).

Input

Each line of input will have exactly one integer, 57 > = N > 0.

Output

For each line of input, output F(N).

Sample Input

1 4 57

Sample Output

1 3 2035586497

#include <stdio.h>
int main()
{
    int d,i=4,j=2;
    int F[60],G[60];
    G[1]=G[3]=1;G[2]=0;
    F[1]=1;
    for (;i<60;i++)
    {
        G[i]=G[i-1]+G[i-3];
        F[i-2]=F[i-3]+G[i-3];
    }
    while(scanf("%d",&d)!=EOF)
    {
        printf("%d\n",F[d]);
    }
    return 0;
}