Hat's Fibonacci

Problem Description

A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.

Input

Each line will contain an integers. Process to end of file.

Output

For each case, output the result in a line

#include <stdio.h>
#include <string.h>
int get_de(int *a, int l)
{
    int i,k;
    k = 0;
    for ( i = 0; i < l; i++)
{ a[i] += k;
      k = a[i]/10;
      a[i] %= 10;
}
    if ( k > 0)
{ a[i] = k;
      l++;
}
    return l;
}
int main()
{ int a[5][3000];
  int n,i,j,len,k;
  int a1,a2,a3,a4;
  while ( scanf("%d",&n) != EOF)
  {if ( n <= 4)
  {printf("1\n");
   continue;
  }
  memset(a,0,sizeof(a));
  a[0][0] = a[1][0] = a[2][0] = a[3][0] = 1;
  j = 4;
  len = 1;
  i = 4;
  while (1)
{a1 = (j + 1)%5;
 a2 = (j + 2)%5;
 a3 = (j + 3)%5;
 a4 = (j + 4)%5;
 for ( k = 0; k < len; k++)
{a[j][k] = a[a1][k] +a[a2][k] + a[a3][k] + a[a4][k];}
 len = get_de(a[j],len);
 if ( i >= n-1 )
 { break;}
 j = (j+1)%5;
 i++;
  }
for ( k = len-1; k >= 0; k--)
{ printf("%d",a[j][k]);
}
printf("\n");
}
return 0;
}