题目:
设计一个算法实现超长正整数的相加。
输入:两个超长正整数
输出:这两个数相加的结果
例子:
输入:两个整数123456789123456789 123456789123456789
输出:这两个数相加的结果246913578246913578
代码:
#include<iostream>
#include<string>
using namespace std;
int main()
{
string input1, input2;
string output;
cin >> input1 >> input2;
string longer = input1.size() >=input2.size() ? input1 : input2;
string shorter = input1.size() < input2.size() ? input1 : input2;
int longer_size = longer.size();
int shorter_size = shorter.size();
int zero_num = longer_size - shorter_size;
string zero(zero_num, '0');
shorter = zero + shorter;
int *p = new int[longer_size + 1];
int