Description: Given a set of coins, a total of N pieces, N-1 pieces is good, one bad. All the good coins have the same weight, the weight of bad coin with good coin, and there is a good coin flag. Write a program to determine whether to use a maximum of K times the balance for a given n and k, identify the bad coin. If the output " Possible" , otherwise output " Impossible" .
To Search:
File list (Check if you may need any files):
data.out
badCoin.c
data.in
Download