← 返回题目

题库练习 [COCI-2010_2011-contest3]#5 ZBROJ

← 上一题下一题 →

A1201 | $[COCI-2010_2011-contest3]#5 ZBROJ$

来源COCI

时间限制1s

内存限制128MB

通过 / 提交0/0

题目描述

After he got tired of rotating tables, the teacher gave Perica another problem. She wrote two integers, A and B, on the blackboard and asked him to add them. Perica is never wrong with his calculation, but sometimes he doesn’t copy the numbers correctly. The only mistake he ever makes is copying a ‘5’ as a ‘6’, and viceversa. Given two numbers, A and B, calculate the minimum and the maximum sum Perica could possibly get.

输入格式

The first and only line of input contains positive integers A and B (1 \leq A, B \leq 1 000 000).

输出格式

In single line of output, print two space separated integers, minimum and maximum sum Perica could get.

输入输出样例

输入 #1

11 25

输出 #1

36 37

输入 #2

1430 4862

输出 #2

6282 6292

输入 #3

16796 58786

输出 #3

74580 85582

C++ 编辑器

输入

输出