A + B
Author: Suhendry Effendy
This is the easiest problem in the contest.
The smallest possible A + B can be obtained from A and B in their smallest possible number base. To find this you only need to find the largest digit in A (and B) which is x and its smallest base is x + 1.
I figure out that I choose wrong title for this problem. “A + B” attracts many teams to read this problem early in the contest because it sounds “easy”.
This problem was solved by 66 teams. The first team to solve this problem: HKUST_Optimus Prime from Hong Kong University of Science and Technology, minute 3.