Forgetful Addition

Difficulty: 1200 2000 ms 128 MB

implementation

Add A and B digit by digit but FORGET every carry (each result digit is (a+b) mod 10). Print the result without leading zeros.

Input: one line with two integers A and B.

Output: the carry-less sum.

Constraints:

• 0 ≤ A, B ≤ 10¹⁸

Sample Tests

175 266

331

99 1

90

Read the Editorial