Hi!

I'm trying to solve UVa 12732, but the judge gives me wrong answer. My idea is that if I have n numbers then I compare two disjunct group of integers. This way in one query I can reduce the set of potential heavier coins from n to , and then I do the same on these potential heavier coins, until there will be a trivial case like only one or two coins remained. So it does queries I think. And for 3 ≤ n ≤ 120 it's less or equal than 5. Could anyone help my why does it get this verdict?

Here is my code: http://ideone.com/XYG4fz

Have a nice day.

mraron