HDU5810 Balls and Boxes

Jelly_acm

于 2017-07-13 23:09:59 发布

阅读量368

点赞数

分类专栏： HDU ----GCD

本文链接：https://blog.csdn.net/Jelly_acm/article/details/75094269

版权

HDU 同时被 2 个专栏收录

181 篇文章 0 订阅

订阅专栏

----GCD

7 篇文章 0 订阅

订阅专栏

Balls and Boxes

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 797 Accepted Submission(s): 526

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.

Author

SYSU

Source

2016 Multi-University Training Contest

—————————————————————————————————

题意：把n个球放到m个盒子里面,求上面这个式子的期望;

思路：打表找规律，发现答案=n*(m-1)/m*m 求gcd即可

证明：

E(V)=1/m*E(∑(x _i-x) ²)=E((x-n/m) ²)=E(x ²)-2*n/m*E(x)+n ²/m ²

E(x)=n/m;E(x ²)=D(x)+[E(x)] ²;变成二项分布了,D(x)=n*(m-1)/m ²

所以带到上面的式子中就变成了E(v)=n*(m-1)/m ²

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

LL n,m;

LL gcd(LL x,LL y)
{
    return x?gcd(y%x,x):y;
}

int main()
{
    while(~scanf("%lld%lld",&n,&m)&&(n+m))
    {
        if(m==1) {printf("0/1\n");continue;}
        n=(m-1)*n;
        m=m*m;
        printf("%lld/%lld\n",n/gcd(n,m),m/gcd(n,m));
    }
    return 0;
}