好贷网好贷款

uva 11218 - KTV

发布时间:2016-12-3 21:54:42 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"uva 11218 - KTV",主要涉及到uva 11218 - KTV方面的内容,对于uva 11218 - KTV感兴趣的同学可以参考一下。

Problem K KTV One song is extremely popular recently, so you and your friends decided to sing it in KTV. The song has 3 characters, so exactly 3 people should sing together each time (yes, there are 3 microphones in the room). There are exactly 9 people, so you decided that each person sings exactly once. In other words, all the people are divided into 3 disjoint groups, so that every person is in exactly one group. However, some people don't want to sing with some other people, and some combinations perform worse than others combinations. Given a score for every possible combination of 3 people, what is the largest possible score for all the 3 groups? Input The input consists of at most 1000 test cases. Each case begins with a line containing a single integern (0 < n < 81), the number of possible combinations. The next n lines each contains 4 positive integersa, b, c, s (1 <= a < b < c <= 9, 0 < s < 10000), that means a score of s is given to the combination (a,b,c). The last case is followed by a single zero, which should not be processed. Output For each test case, print the case number and the largest score. If it is impossible, print -1. Sample Input 3 1 2 3 1 4 5 6 2 7 8 9 3 4 1 2 3 1 1 4 5 2 1 6 7 3 1 8 9 4 0 Output for the Sample Input Case 1: 6 Case 2: -1 方法 : 直接 暴力枚举。 代码 :

上一篇:Android xml文件的序列化
下一篇:给FLASH加链接的方法

相关文章

关键词: uva 11218 - KTV

相关评论