程序代码：

#include <stdio.h>

#define  max 50

void char_add(char* a,char* b,char* c)
{
    int ia[max]={0};
    int ib[max]={0};
    int ic[max]={0};
    int flag=0,flag2=0;
    int i,j;
    for(i=0;i<max;i++)
    {
        if(a[i]=='\0') ia[i]=0; else  ia[i]=a[i]-'0';
        if(b[i]=='\0') ib[i]=0; else  ib[i]=b[i]-'0';
    }
    //加法运算这个循环没啥问题了，不需要再改进了
    for(i=max-1;i>=0;i--)
    {
        ic[i]=ia[i]+ib[i]+flag;
        if(ic[i]>9) {flag=1;ic[i]-=10;} else flag=0;
    }
       for(j=0;j<max;j++) {c[j]=ic[j]+'0';}
       c[j]='\0';
}

int main()
{

 
    char a[max]={'\0'};
    char b[max]={'\0'};
    char c[max]={'\0'};
    int i,j;
    a[max-1]='1';
    b[max-1]='1';
    j=0;
    while(j<48)
    {
        char_add(a,b,c);
        for(i=0;i<max;i++)
        {
            a[i]=b[i];
            b[i]=c[i];
        }
        j++;
        printf("%s\n",c);
    }
    return 0;
}

程序代码：

                                                                                                    2
                                                                                                    3
                                                                                                    5
                                                                                                    8
                                                                                                   13
                                                                                                   21
                                                                                                   34
                                                                                                   55
                                                                                                   89
                                                                                                  144
                                                                                                  233
                                                                                                  377
                                                                                                  610
                                                                                                  987
                                                                                                 1597
                                                                                                 2584
                                                                                                 4181
                                                                                                 6765
                                                                                                10946
                                                                                                17711
                                                                                                28657
                                                                                                46368
                                                                                                75025
                                                                                               121393
                                                                                               196418
                                                                                               317811
                                                                                               514229
                                                                                               832040
                                                                                              1346269
                                                                                              2178309
                                                                                              3524578
                                                                                              5702887
                                                                                              9227465
                                                                                             14930352
                                                                                             24157817
                                                                                             39088169
                                                                                             63245986
                                                                                       

程序代码：

#include<stdio.h>

#define MAX_N      50
#define MAX_LEN    128

int main()
{
    char f[MAX_N][MAX_LEN] = {"1","1"};
    int a[MAX_LEN] = {1};
    int b[MAX_LEN] = {1};
    int c[MAX_LEN] = {0};
    int *p  = c;
    int *p1 = b;
    int *p2 = a;
    int *pt;
    int i, j, t;

 
    for(i = 2; i < MAX_N; i++)
    {
  
        for(t = j = 0; j < MAX_LEN; j++)
        {
            p[j] = p1[j] + p2[j] + t;
            if(p[j]>9) {t=1;p[j]-=10;} else t=0;
        }
        for(j = MAX_LEN - 1; p[j] == 0; j--);
        for(t = 0; j >= 0; t++) { f[i][t] = p[j] + '0';j--;}
        pt = p2;
        p2 = p1;
        p1 = p;
        p  = pt;
    }
         
    for(i = 0; i < MAX_N;i++) printf("F[%03d] = %s\n", i, f[i]);

 
    return 0;
}