It looks like you can solve this arithmetically . I'm splitting the coins into group of 5 and 6, but this method will work for any sort of grouping as long as you use all the coins.
Let A be the weight of the group of 5 coins. Let B be the weight of the group of 6 coins. Let x = real coin, and y = fake coin.
Then there's only two possibilities, either the fake is in the group of 5 or 6:
5x = A, 5x + y = B, C = A + B = 10x + y
or 4x + y = A, 6x = B, C = A + B = 10x + y
Clearly the solution is unique.
At the start of the algorithm, simply let x = A/5. Solve for y, y = B - 5x. If 10x + y = C, then you have guess correctly that the group of 5 consists of only real coins.
Else, your initial guess was incorrect and its actually the second case. So set x = B/6, y = A - 4x.