레이팅 미적용설명
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 vice versa.
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 \le A, B \le 1\,000\,000\)).
출력 형식
In single line of output, print two space separated integers, minimum and maximum sum Perica could
get.
서브태스크
| 서브태스크 | 점수 | 설명 |
|---|---|---|
Test 1 | 10점 | None |
Test 2 | 10점 | None |
Test 3 | 10점 | None |
Test 4 | 10점 | None |
Test 5 | 10점 | None |
Test 6 | 10점 | None |
Test 7 | 10점 | None |
Test 8 | 10점 | None |
Test 9 | 10점 | None |
Test 10 | 10점 | None |
예제 1
입력
11 25출력
36 37예제 2
입력
1430 4862출력
6282 6292예제 3
입력
16796 58786출력
74580 85582문제 정보
태그