영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
It's frustrating for Tor and his mother that sometimes there's a carrot left (see the task Carrots). Instead of sharing it, Tor suggests rolling dice to decide who gets the carrot. He takes out N dice, each with M sides, numbered from 1 to M, each with an equal probability of being rolled. He then lets his mother choose K numbers, and if the numbers on the dice sum up to one of those numbers, she wins; otherwise, Tor wins. Now, Mother wants your help to write a program to determine her chances of winning if she chooses her outcomes optimally.
Input
Input consists of the the three integers N, M, K (1 ≤ N ≤ 20, 1 ≤ M ≤ 5000, 1 ≤ K < N · M), the number of dice, how many sides each dice has and how many outcomes Mother can choose.
Output
Print a real number: the probability that Mother will win if she chooses her outcomes optimally. The answer will be considered correct if it has an absolute error of at most 10^-5.
Scoring
Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 20 | N=2, M ≤ 100 |
| 2 | 20 | N ≤ 6, M ≤ 6 |
| 3 | 20 | N ≤ 12, M ≤ 12 |
| 4 | 20 | N ≤ 20, M ≤ 100 |
| 5 | 20 | No additional constraints. |
예제
예제 1
2 6 2
0.305555555555556
예제 2
3 7 4
0.41399416909621
예제 3
20 2189 2734
0.369028440650235