QOJ.ac

QOJ

実行時間制限: 1.0 s メモリ制限: 32 MB 満点: 50

#16989. ZBROJ

統計

在厌倦了旋转表格之后,老师给 Perica 出了另一个问题。她在黑板上写了两个整数 $A$ 和 $B$,并让他把它们加起来。

Perica 的计算从来不会出错,但有时他抄写数字时会出错。他唯一会犯的错误是将 '5' 抄成 '6',反之亦然。

给定两个数字 $A$ 和 $B$,计算 Perica 可能得到的最小和最大和。

输入格式

输入的第一行也是唯一的一行包含两个正整数 $A$ 和 $B$($1 \le A, B \le 1\,000\,000$)。

输出格式

在单行输出中,输出两个用空格隔开的整数,分别表示 Perica 可能得到的最小和最大和。

样例

输入 1

11 25

输出 1

36 37

输入 2

1430 4862

输出 2

6282 6292

输入 3

16796 58786

输出 3

74580 85582

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.