Balls and Boxes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 798 Accepted Submission(s): 527
Problem Description
Mr. Chopsticks is interested in random phenomena, and he conducts an experiment to study randomness. In the experiment, he throws n balls into m boxes in such a manner that each ball has equal probability of going to each boxes. After the experiment, he calculated the statistical variance V as
where X
i![]()
is the number of balls in the ith box, and
X
¯![]()
is the average number of balls in a box.
Your task is to find out the expected value of V.
V=∑
m
i=1
(X
i
−X
¯
)
2![]()
m![]()
![]()
where X
Your task is to find out the expected value of V.
Input
The input contains multiple test cases. Each case contains two integers n and m (1 <= n, m <= 1000 000 000) in a line.
The input is terminated by n = m = 0.
The input is terminated by n = m = 0.
Output
For each case, output the result as A/B in a line, where A/B should be an irreducible fraction. Let B=1 if the result is an integer.
Sample Input
2 1 2 2 0 0
Sample Output
0/1 1/2
规律是ans=((m-1)/(m*m))*n; 可以通过从1 1到5 5打表得到。