COCI '15 Contest 4 #1 Yoda

View as PDF

Submit solution

Points: 5 (partial)
Time limit: 1.0s
Memory limit: 64M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

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.

Input

The first line of input contains the integer N (1 \le N \le 10^9), one of the integers from the task.

The second line of input contains the integer M (1 \le N \le 10^9), one of the integers from the task.

Output

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.

Scoring

In test cases worth 30% points it will hold that N and M consist of three digits.

Sample Input 1

300
500

Sample Output 1

0
500

Sample Input 2

65743
9651

Sample Output 2

673
95

Sample Input 3

2341
6785

Sample Output 3

YODA
6785

Comments

There are no comments at the moment.