GO Solution For UVa 10633 - Rare Easy Problem. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

N is a random number, which for some reason, is at least two digits. John Doe, a nondescript man, performs an operation on N : he chops off the last digit to form a new number M , and then finds N−M . This excites him in a hard-to-justify way. He then tells you N−M . Thrilled by the fascinating back

...

You can find the full details of the problem Rare Easy Problem at UVa Online Judge

Sample Input

18
0

Sample Output

19 20

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985