C-高精度加法

加数和被加数都保存在字符数组里，考虑存放结果的数组长度，先计算结果，最后逐位进位(从后往前)，亲测可用

#include<stdio.h>

#include<string.h>

int main()

{

         inti,j,alen,blen,*s,max;

         char a[50],b[50];

         printf("请输入被加数：");

         gets(a);

         printf("请输入加数：");

         gets(b);

         alen=strlen(a);

         blen=strlen(b);

         if(alen>blen)

                   max=alen;

         else

                   max=blen;

         s=(int *)malloc(sizeof(int)*(max+1));

         for(i=0;i<max+1;i++)   //初始化s

                   s[i]=0;

         for(i=alen-1,j=blen-1;i>=0||j>=0;i--,j--)  //对应位相加

         {

                   if(i>=0&&j>=0)

                   {

                            if(i>j)

                                     s[i+1]=(a[i]-'0')+(b[j]-'0');

                            else

                                     s[j+1]=(a[i]-'0')+(b[j]-'0');

                   }

                   elseif(i<0)

                            s[j+1]=b[j]-'0';

                   elseif(j<0)

                            s[i+1]=a[i]-'0';

         }

         for(i=max+1;i>=0;i--)//从后往前逐位进位

                   if(s[i]>=10)

                   {

                            s[i-1]=s[i-1]+s[i]/10;

                            s[i]=s[i]%10;

                   }

         i=0;

         while(s[i]==0) //判断第一位是否有进位

                   i++;

         for(;i<max+1;i++)  //输出数组s，s即存储了计算结果

                   printf("%d",s[i]);

         printf("\n");

         return 0;

}