Uva 10013 - Super long sums

Problem: 10013 - Super long sums

---

The Problem

The creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers need to operate even larger numbers. A limit of 1000 digits is so small... You have to find the sum of two numbers with maximal size of 1.000.000 digits.


The Input

The first line of a input file is an integer N, then a blank line followed by N input blocks. The first line of an each input block contains a single number M (1<=M<=1000000) --- the length of the integers (in order to make their lengths equal, some leading zeroes can be added). It is followed by these integers written in columns. That is, the next M lines contain two digits each, divided by a space. Each of the two given integers is not less than 1, and the length of their sum does not exceed M.

There is a blank line between input blocks.

The Output

Each output block should contain exactly M digits in a single line representing the sum of these two integers.

There is a blank line between output blocks.

Sample Input

2

4
0 4
4 2
6 8
3 7

3
3 0
7 9
2 8

Sample Output

4750

470

---

Description of the Solution:

---

1. Need a[100001] & b[1000001] character type array. Because the value of the array not more than 9.
2. Must print the last carry & be careful to print last newline
3. Each case: take input from 1 no array index. so that you can put last carry in 0 index.
4. For example:
A[][2][3][4][5]
B[][9][4][3][5] so here last index=4
Add:
I=4, (a[4]+b[4])%10+carry[initially it zero]=0 =reault[4=i]
Carry=(a[4]+b[4])/10
I=3,similarly, result[i]=8 carry=0
I=2 ,similarly result[i]=7 carry=0
I=1,similarly result[i]=1 carry=1
I=0 ,result[i]=carry

---

Code In C/C++:

---