Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Colored stones
Description You are given a row of Input The input test file will contain multiple test cases. Each input test case begins with a single line containing the integers m and k where 1 ≤ k}, representing the k different stone colors. The end-of-file is marked by a test case with m = k = 0 and should not be processed.Output For each input case, the program should the minimum number of stones removed to satisfy the condition given in the problem. Sample Input 10 3 2 1 2 2 1 1 3 1 3 3 0 0 Sample Output 2 Hint In the above example, an optimal solution is achieved by removing the 2nd stone and the 7th stone, leaving three “2” stones, three “1” stones, and two “3” stones. Other solutions may be possible. Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator