[1254] B + A
- 时间限制: 1000 ms 内存限制: 65535 K
- 问题描述
-
This problem is pretty easy.
It just like the A + B problem.
But this one is special, The special rule is that we don't need calculate all the carry problem(进位).
For example, the 22 plus 99 is equal to 11, the 19 plus 90 is equal to 09.
- 输入
-
There are muti-case.
For each case, there are two postive integers B, A (0 < B, A < 100000) - 输出
-
For each case, print the answer by the new rule.
- 样例输入
-
1 2 4 9 22 1 23 45 99 99
- 样例输出
-
3 3 23 68 88
- 提示
-
无
- 来源
-
monkeyde17
- 操作
-
