Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- char a[10000][5005];
- void sum(char u[1000],char v[1000],char x[1000],long long int element)
- {
- int l,l1,l2,i,j,k,dl;
- char d[5005];
- l1=strlen(u);
- l2=strlen(v);
- dl=0;
- k=0;
- for(i=l1-1,j=l2-1;i>=0 && j>=0;i--,j--)
- {
- l=(u[i]-'0')+(v[j]-'0')+dl;
- dl=l/10;
- d[k]=(l%10)+'0';
- k++;
- }
- if(i!=-1){
- dl=dl+(u[i]-'0');
- i--;
- while(i!=-1)
- {
- dl=dl*10+(u[i]-'0');
- i--;
- }
- }
- if(j!=-1){
- dl=dl+(v[j]-'0');
- j--;
- while(j!=-1)
- {
- dl=dl*10+(v[j]-'0');
- j--;
- }
- }
- while(dl!=0)
- {
- d[k]=(dl%10)+'0';
- k++;
- dl=dl/10;
- }
- for(j=k-1,i=0; j>=0; j--,i++)
- {
- x[i]=d[j];
- }
- x[i]='\0';
- }
- main()
- {
- long long int n,i;
- a[0][0]='0';
- a[0][1]='\0';
- a[1][0]='1';
- a[1][1]='\0';
- for(i=2;i<=5000;i++)
- {
- sum(a[i-1],a[i-2],a[i],i);
- }
- while(scanf("%lld",&n)==1)
- {
- printf("The Fibonacci number for %d is ", n);
- printf("%s\n",a[n]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement