hdu5810Balls and Boxes+数学期望
来源:互联网 发布:ar2048n 网络打印设置 编辑:程序博客网 时间:2024/06/05 21:18
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.
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
2 1
2 2
0 0
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 7
就是把n个球扔到m个箱子里。扔到每个箱子的概率是相等的,求箱子里球的个数的方差的期望。
这是个随机概率。每个箱子的概率相等,那么方差的期望就是总体的方差。
s=n*p*(1-p);
球等概率的扔到箱子里,所以p=1/m;
所以
#include<cstdio>#include<string>#include<cmath>#include<algorithm>#include<iostream>using namespace std;#define LL long longint main(){ LL n,m; while(scanf("%I64d %I64d",&n,&m)!=EOF){ if(n==0&&m==0) break; LL fz=n*(m-1); LL fm=m*m; LL gcd=__gcd(fz,fm); fz=fz/gcd; fm=fm/gcd; printf("%I64d/%I64d\n",fz,fm); } return 0;}
还有一个详细的推导过程(然而我都不会)
然而某神打表,观察出了规律。秒过。。然而并没有要到打表代码。。。
- hdu5810Balls and Boxes+数学期望
- hdu5810Balls and Boxes
- 数学,期望(Balls and Boxes,HDU 5810)
- hdu 5810 Balls and Boxes (数学)
- hdu5810 Balls and Boxes(数学)
- HDU-5810-Balls and Boxes(方差期望)
- [HDU 5810] Balls and Boxes (随机变量计算期望)
- Kids and Prizes(数学求期望)
- HDU5419Victor and Toys(树状数组+数学期望)
- codeforces454CLittle Pony and Expected Maximum+数学期望
- B. Jeff and Furik----数学期望
- hdu5810——Balls and Boxes(数学推导)
- HDU-5810-Balls and Boxes-数学推导(找规律)
- 数学期望
- 数学期望
- 数学期望
- SGU 495 Kids and Prizes(期望DP || 数学规律)
- HDU5810(2016多校第七场)——Balls and Boxes(组合数学,概率)
- 【Poj】-2253-Frogger(最短路,变化)
- 332. Reconstruct Itinerary(重要)
- 【HDU 2063 过山车】
- 数据结构实验之排序二:交换排序
- 前端-笔试面试知识点
- hdu5810Balls and Boxes+数学期望
- 英语信件常用句式
- HDU1166:敌兵布阵(树状数组)
- set和get方法
- MatLab建模学习笔记7——线性规划问题求解
- HDU 2087 剪花布条(KMP 模板题)
- [OS复习]设备管理2
- 不相容子数组的最大和
- iPhone,iPad横屏竖屏的判断