https://www.spoj.pl/problems/SCALE/ hi guys.. need tips on solving this problem i thought as follows:
search the immediately largest weight to the given number in the series of powers of three(log n) then do bit wise checking to find the set bit (after introducing the given weight in a proper place in the series till the no found in the above step) logic similar to find the subset sum using set bits... http://www.codechef.com/wiki/tutorial-paying now if u analyse the sum generated sums.. not more than 2 cases will have the same sum one denotes the left pan and the other denotes the right pan this worked with test cases i checked... help me out.. thanks guys.. :-) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
