#2198. 高精度加法

高精度加法

Explanation

Problem description

Input two integers a and b, and output the sum of these two integers. Both A and B should not exceed 100 digits.

Algorithm description

Due to the large size of both a and b, they cannot be directly stored using the standard data types in the language. For this type of problem, arrays are generally used to handle it. Define an array A, where A [0] is used to store the bits of a, A [1] is used to store the tens of bits of a, and so on. An array B can also be used to store b.

Input format

The input consists of two lines, the first line is a non negative integer a, and the second line is a non negative integer b. Both integers do not exceed 100 bits, and their highest bits are not 0.

Output format

Output a line representing the values of a and b.

Example

20100122201001221234567890
2010012220100122
20100122203011233454668012