A1532.[COCI-2015_2016-contest4]#6 YODA
省选/NOI-
通过率:0%
时间限制:1.00s
内存限制:128MB
题目描述
A long, long time ago in a galaxy far, far away a big collision of integers is taking place right now.
What happens when two integers collide? During collision, each digit of one number compares itself to the corresponding digit of the other number (the least significant digit with the other’s least significant digit, and so on). The smaller digit “falls out” of the number containing it. Additionally, if the digits are the same, nothing happens. If a number doesn’t consist of a corresponding digit, then we consider it to be zero. After all comparisons of corresponding digits, the leftover digits in the number come closer and create a new number. For example:
Write a programme that will, for two given integers, determine their values after collision. If it happens that all the digits of one number fell out, then for that number output the message “YODA”.
输入格式
The first line of input contains the integer N (1 6 N 6 109 ), one of the integers from the task.
The second line of input contains the integer M (1 6 N 6 109 ), one of the integers from the task.
输出格式
The first line of output must contain the new value of the first given integer from the task.
The second line of output must contain the new value of the second given integer from the task.
输入输出样例
输入#1
300 500
输出#1
0 500
输入#2
65743 9651
输出#2
673 95
输入#3
2341 6785
输出#3
YODA 6785
说明/提示
In test cases worth 30% points it will hold that N and M consist of three digits