2016多校训练Contest7: 1002 Hearthstone hdu5810

最新推荐文章于 2017-07-28 14:15:14 发布

lqybzx

最新推荐文章于 2017-07-28 14:15:14 发布

阅读量391

点赞数

分类专栏：组合数概率文章标签：组合数

本文链接：https://blog.csdn.net/lqybzx/article/details/52166406

版权

组合数同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

概率

3 篇文章 0 订阅

订阅专栏

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

V = \sum m i = 1 ( X i - X ¯ ) 2 m

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.

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

Sample Output

  
  
   
   0/1
1/2


   
   
    
    
     
     Hint
    
    
In the second sample, there are four possible outcomes, two outcomes with V = 0 and two outcomes with V = 1.

$E [V] = E [\frac{ \sum i = 1 m ( X i - X ¯ ) 2 }{ m }] = E [(X i - X ¯ ) 2 ] = E [X i 2 - 2 X i X ¯ + X ¯ 2 ]$

$E[X_i^2] - 2\bar XE[X_i] + E[\bar X^2] = E[X_i^2] - 2\bar X^2 + \bar X^2 = E[X_i^2] - \frac{n^2}{m^2}$

所以关键是要求出 $E[X_i^2]$ . 我们用随机变量 $Y_j$ 来表示第j个球是否在第i个盒子中，如果在则 $Y_j = 1$ ，否则 $Y_j = 0$ . 于是

$E[X_i^2] = E[(\sum_{j=1}^{n} Y_j)^2] = E[\sum_{j=1}^{n} Y_j^2] + 2E[\sum_{j=1}^{n} \sum_{k=1,k\neq j}^{n} Y_jY_k] = nE[Y_j^2] + n(n-1)E[Y_jY_k]$

$=\frac{n}{m}+\frac{n(n-1)}{m^2}$

因此，

$\frac{n}{m} + \frac{n(n-1)}{m^2} - \frac{n^2}{m^2} = \frac{n(m-1)}{m^2}$

官方题解如上。。因为是队友推的我具体不太清楚。。

#include <stdio.h>
#include <algorithm>
using namespace std;
typedef __int64 ll;
ll gcd(ll n,ll m){
    ll r;
    while(m){
        r = n%m;
        n = m;
        m = r;
    }
    return n;
}

int main(void){
    ll a,b;
    ll n,m;
    while(scanf("%I64d%I64d",&n,&m)!=EOF){
        if(n==0&&m==0){
            break;
        }
        a = n*(m-1);
        b = m*m;
        ll g = gcd(a,b);
        printf("%I64d/%I64d\n",a/g,b/g);
    }
    return 0;
}