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.
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.
Sample Input
100
Sample Output
4203968145672990846840663646
Note:
No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <malloc.h>
using namespace std; void add(char* a,char* b,char* c)
{
int i,j,k,max,min,n,temp;
char *s,*pmax,*pmin;
max=strlen(a);
min=strlen(b);
if (max<min)
{
temp=max;
max=min;
min=temp;
pmax=b;
pmin=a;
}
else
{
pmax=a;
pmin=b;
}
s=(char*)malloc(sizeof(char)*(max+));
s[]='';
for (i=min-,j=max-,k=max; i>=; i--,j--,k--)
s[k]=pmin[i]-''+pmax[j];
for (; j>=; j--,k--)
s[k]=pmax[j];
for (i=max; i>=; i--)
if (s[i]>'')
{
s[i]-=;
s[i-]++;
}
if (s[]=='')
{
for (i=; i<=max; i++)
c[i-]=s[i];
c[i-]='\0';
}
else
{
for (i=; i<=max; i++)
c[i]=s[i];
c[i]='\0';
}
free(s);
}
char a[][];
int main(void)
{
int i,n;
for(i=;i<=;i++)
strcpy(a[i],"");
for(i=;i<;i++)
{
char x[],y[];
add(a[i-],a[i-],x);
add(a[i-],a[i-],y);
add(x,y,a[i]);
}
while(cin>>n)
{
cout<<a[n]<<endl;
}
return ;
}