#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
int n,x,y,k;
string stl1,stl2;
cin>>n;
for (int i=0;i<n;i++)
{
int a[1002]={0},b[1002]={0},c[1002]={0};
cin>>stl1>>stl2;
x=stl1.length();//用于字符串对象的的长度 strlen()用于字符数组
y=stl2.length();
int z=max(x,y);
int j;
for(j=1;j<=x;j++)
{
a[j-1]=stl1[x-j]-'0';
}
int m;
for(m=1;m<=y;m++)
{
b[m-1]=stl2[y-m]-'0';
}
int q;
for(q=0;q<z;q++)
{
c[q]+=(a[q]+b[q]);
if(c[q]>=10)
{
c[q]=c[q]-10;
c[q+1]=1;
}
k=q+2;
}
int l=0;
cout<<"Case "<<i+1<<":"<<endl;
cout<<stl1<<" + "<<stl2<<" = ";
int p;
for(p=1;p<=k;p++)
{
if(l==0&&c[k-p]!=0)
l=1;
if(l==1)
cout<<c[k-p];
}
cout<<endl;
if(i<n-1)
cout<<endl;
}
return 0;
}
个人积累 纯大数加法
最新推荐文章于 2024-09-13 17:43:09 发布