UVA - 424-day3I

问题来源

UVA - 424

问题描述

One of the first users of BIT’s new supercomputer was Chip Diller. He extended his exploration of
powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
“This supercomputer is great,” remarked Chip. “I only wish Timothy were here to see these results.”
(Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky
apartments on Third Street.)

输入

The input will consist of at most 100 lines of text, each of which contains a single VeryLongInte-
ger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no
VeryLongInteger will be negative).
The final input line will contain a single zero on a line by itself.

输出

Your program should output the sum of the VeryLongIntegers given in the input.

例子

input

123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

output

370370367037037036703703703670

解题思路

大数运算
先输入字符串转int
倒序并全加到一个int数组
进位然后倒序输出。

AC的代码

#include<string>
#include<memory.h>
#include <iostream>
using namespace std;
int a1[105];
int main()
{
	string aa;
	string bb;
	int b1[105];
	cin >> aa;
	for (int g = 0; g < aa.size(); g++)
		{
			a1[aa.size() - g - 1] = (int)(aa[g] - '0');
		}
	while (cin >> bb&&bb[0]!='0')
	{
		memset(b1, 0, sizeof(b1));
		for (int f = 0; f < bb.size(); f++)
		{
			b1[bb.size() - f - 1] = (int)(bb[f] - '0');
		}
		for (int g1 = 0; g1 < 102; g1++)
		{
			a1[g1] += b1[g1];
		}
	}
	for (int i = 0; i < 102; i++)
	{
		if (a1[i] >= 10)
		{
			a1[i + 1] += a1[i] / 10;
			a1[i] = a1[i] - (a1[i] / 10) * 10;
		}
	}
	int flag=1;
	for (int h = 102; h >= 0; h--)
	{
		if (a1[h] == 0 && flag)
		{
			continue;
		}
		flag = 0;
		cout << a1[h];
	}
	cout << endl;

}