思路:妈呀数学智障并不知道怎么推...全靠意识...
E[V]=E[m∑i=1m(Xi−X¯)2]=E[(Xi−X¯)2]=E[Xi2−2XiX¯+X¯2]
=E[Xi2]−2X¯E[Xi]+E[X¯2]=E[Xi2]−2X¯2+X¯2=E[Xi2]−m2n2
所以关键是要求出E[Xi2]. 我们用随机变量Yj来表示第j个球是否在第i个盒子中,如果在则Yj=1,否则Yj=0. 于是
E[Xi2]=E[(∑j=1nYj)2]=E[∑j=1nYj2]+2E[∑j=1n∑k=1,k≠jnYjYk]=nE[Yj2]+n(n−1)E[YjYk]
=mn+m2n(n−1)
因此,
E[V]=mn+m2n(n−1)−m2n2=m2n(m−1)
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL gcd(LL a, LL b){return a == 0 ? b : gcd(b%a, a);}
int main()
{
LL n,m;
while(scanf("%lld%lld",&n,&m)!=EOF&&(n+m))
{
if(m==1)
{
printf("0/1\n");
continue;
}
else
{
LL gg = gcd(n*(m-1),m*m);
printf("%lld/%lld\n",n*(m-1)/gg,m*m/gg);
}
}
}
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 Xi 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=∑mi=1(Xi−X¯)2m
where Xi 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.
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/2HintIn the second sample, there are four possible outcomes, two outcomes with V = 0 and two outcomes with V = 1.