SCALE - Funny scales
Kinh_Can has a set of precious weights P1, P2, ..., PN in which the mass of the ith weight is Pi = 3i-1, and a balance with 2 scales. On a nice day, Kinh_Can decided to show off his set of precious weights to his friends, and said that he can put them in equilibrium with any weight as long as its mass is not more than the mass of the sum of his weights. At first, his friends didn't believe, but after many trials they realized that Kinh_Can was right. In addition, while putting a thing whose mass is X on a scale, Kinh_Can could put right away the weights added on the 2 scales to keep their balance without any trial. With a random weight X (X is a natural number, X ≠ 0). Your task is to put weights on scales in order to keep the 2 scales' balance like Kinh_Can. The first scale initially weights X, and the second one weights 0.
Input has exactly one line consisting 2 numbers, the first is N and the second is X.
- If there is no solution, you should write -1
- If there is at least one solution for the problem, you should write exactly 2 lines:
- The first line contains some numbers descripting the indices of the weights in the first disc
- The second line contains some numbers description the indices of the weights in the second disc
- Note: One of 2 lines can be blank
- 1 ≤ N ≤ 20
- 1 ≤ X ≤ 2000000000
Input 1: 10 2 Output 1: 1 2
Input 2: 10 5 Output 2: 1 2 3
Good Problem. No Idea on how to use the binary search here though. But brute force solution is cool enough.
AC in one go!!!Last edit: 2019-12-16 18:28:42
Solved it O(N) :)
I think this problem is purely solved by mathematics (Ternary numeral system).
It looks like some inputs contain more than one line. Continue reading until EOF or n < 1 or x < 1
Try these cases :
Best Test case is :