问题链接:https://vjudge.net/problem/HDU-1002
问题简述:求A+B的和,A和B的位数不会超过1000位。
Get:进行高精度运算。用两个字符数组接收A和B,再用两个整型数组接收字符数组,两个整型数组相加,若位数相加大于10,则进一位,当前位减10(因为只有两位数,所以只需要减10),输出结果。(需要注意细节)
AC代码:
#include <string>
#include <iostream>
using namespace std;
int main()
{
string a, b;
int i,j,l1,l2,n;
cin >> n;
for(j=1;j<n+1;j++)
{
int c[1000] = { 0 }, d[1000] = { 0 };
cin >> a >> b;
l1 = a.length();
l2 = b.length();
int max = l1 > l2 ? l1 : l2;
for (i = l1-1; i >=0; i--)
{
c[l1 - i - 1] = a[i] - 48;
}
for (i = l2 - 1; i >= 0; i--)
{
d[l2 - i - 1] = b[i] - 48;
}
for (i = 0; i < max; i++)
{
c[i] = c[i] + d[i];
if (c[i] > 9)
{
if (i == max - 1)
{
max++;
}
c[i + 1]++;
c[i] -= 10;
}
}
cout << "Case " << j << ":" << endl << a << " + " << b << " = ";
for (i = max-1; i >=0; i--)
{
cout << c[i];
}
if (j != n)
{
cout << endl<<endl;
}
else
{
cout << endl;
}
}
}