hdoj5570balls【求期望】

最新推荐文章于 2019-01-01 16:50:30 发布

飘摇的尘土

最新推荐文章于 2019-01-01 16:50:30 发布

阅读量395

点赞数

分类专栏：数学文章标签： hdoj5570balls求期望

本文链接：https://blog.csdn.net/R1986799047/article/details/50636367

版权

数学专栏收录该内容

111 篇文章 0 订阅

订阅专栏

balls

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 186 Accepted Submission(s): 125

Problem Description

There are

n balls with

m colors. The possibility of that the color of the

i -th ball is color

j is

ai,jai,1+ai,2+...+ai,m . If the number of balls with the

j -th is

x , then you should pay

x2 as the cost. Please calculate the expectation of the cost.

Input

Several test cases(about

5 )

For each cases, first come 2 integers,

n,m(1≤n≤1000,1≤m≤1000)

Then follows

n lines with

m numbers

ai,j(1≤ai≤100)

Output

For each cases, please output the answer with two decimal places.

Sample Input

Sample Output

Source

BestCoder Round #63 (div.2)

参考博客：点击打开链接

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<vector>
using namespace std;
const int maxn=1010; 
double p[maxn][maxn];
int main()
{
	int n,m,i,j,k;
	while(scanf("%d%d",&n,&m)!=EOF){
		for(i=0;i<n;++i){
			double sum=0;
			for(j=0;j<m;++j){
				scanf("%lf",&p[i][j]);
				sum+=p[i][j];
			}
			for(j=0;j<m;++j){
				p[i][j]/=sum;
			}
		}
		double ans=0;
		for(j=0;j<m;++j){
			double sum=0;
			for(i=0;i<n;++i){
				sum+=p[i][j];
				ans+=p[i][j];
				ans-=p[i][j]*p[i][j];
			}
			ans+=sum*sum;	
		}
		printf("%.2lf\n",ans);
	}
	return 0;
}