시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
5 초 | 512 MB | 14 | 13 | 10 | 90.909% |
Dave is taking a multiple choice test on the Internet. Dave possibly gets many opportunities to submit his answers to the test, but he passes only if he gets all the questions correct. He must answer every question on the test to make a submission. The only information he receives after he submits is whether he has passed.
For each question, he estimates the probability that each of 4 responses is correct, independent of his responses to other questions. Given a fixed number of submissions he can make, Dave wants to choose his responses so that he maximizes the probability of passing the test.
What is the probability that Dave will pass the test if he chooses his responses optimally?
The first line of input gives the number of cases, C. C test cases follow.
Each test case starts with a line containing M and Q. Dave is allowed to make Msubmissions to solve the test. There are Q questions on the test. Q lines follow, each containing 4 probabilities of correctness. There will be at most 6 digits after the decimal point. The probabilities for each line are non-negative and sum to 1.
Limits
For each test case, output one line containing "Case #X: Y" where X is the number of the test case (starting from 1), and Y is the probability of success.
Answers with a relative or absolute error of at most 10−6 will be considered correct.
3 10 2 0.25 0.25 0.25 0.25 0.25 0.25 0.25 0.25 64 3 0.3 0.4 0.0 0.3 1.0 0.0 0.0 0.0 0.2 0.2 0.2 0.4 3 2 0.5 0.17 0.17 0.16 0.5 0.25 0.25 0.0
Case #1: 0.625 Case #2: 1.0 Case #3: 0.5
Contest > Google > Code Jam > Google Code Jam 2008 > AMER Semifinal C1번