Zbroj
브론즈 II의견: 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 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 |
11 2536 371430 48626282 629216796 5878674580 85582평가 및 의견
Zbroj
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Zbroj