大数的计算

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
        int mark1,x,mark2,i,j,k,math1[50],math2[50],rem[200][200],ans[200],q,s,math3[50];
        char c[50],bec[50];
        scanf("%s",c);
        scanf("%s",bec);
        for(mark1=0;c[mark1]!='\0';mark1++)
                math1[mark1]=c[mark1]-'0';
        for(mark2=0;bec[mark2]!='\0';mark2++)
                math2[mark2]=bec[mark2]-'0';
                for(i=mark1,j=0;i>=0;j++,i--)
                        math3[j]=math1[i];
                for(i=mark2,j=0;i>=0;j++,i--)
                        math1[j]=math2[i];
        for(i=1;i<105;i++)
                for(j=1;j<105;j++)
                rem[i][j]=0;
                for(i=1;i<=mark1;i++)
                {
                        k=i;
                        for(j=1;j<=mark2;j++,k++)
                        {
                                rem[i][k]=math3[i]*math1[j];
                        }
                }
      for(i=1;i<=100;i++)
      {
                for(j=1,q=0;j<=100;j++)
                {
                        rem[i][j]=rem[i][j]+q;
                        q=rem[i][j]/10;
                        rem[i][j]=rem[i][j]%10;
                }
      }
       for(i=1,q=0;i<=100;i++)
       {
               ans[i]=ans[i]+q;
                for(j=1;j<=100;j++)
                {
                        ans[i]=rem[j][i]+ans[i];
                }
                q=ans[i]/10;
                ans[i]=ans[i]%10;
       }

       for(j=102,i=102,k=0;i>0;)
        {
                if(j==i&&ans[i]==0)
                {
                        i--;
                        j--;
                }
                else
                {
                        printf("%d",ans[i]);
                        i--;
                        k=1;}
                        if(k==0&&i==0) printf("0");
        }
        return 0;
}

 

转载于:https://www.cnblogs.com/Tree-dream/p/5333911.html