#include<stdio.h>
#include<string.h>
#include<assert.h>
#include<stdlib.h>
#define N (100)
int main()
{
int n = 0;
int i = 0;
int j = 0;
unsigned char a[N] ;
unsigned char b[N] ;
unsigned char t[N] ;
unsigned char carry = 0;
unsigned char sum = 0;
memset(a, 0, N); //按字节赋值
memset(b, 0, N);
memset(t, 0, N);
a[0]=1;
b[0]=2;
for( i=2; i<N; ++i)
{
memcpy(t, b, N);
carry = 0;
for( j=0; j<N; ++j)
{
sum= a[j]+b[j]+carry;
carry=sum/10;
b[j]=sum%10;
}
memcpy(a, t, N);
}
for( i=N-1; i>=0; --i)
{
if(b[i])
{
break;
}
}
for( j=i; j>=0; --j)
{
printf("%c", 48+b[j]);
}
printf("\n");
return 0;
}
挺有意思的程序 斐波那契数列的简单应用