balls
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 90 Accepted Submission(s): 59
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)
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
2 2 1 1 3 5 2 2 4 5 4 2 2 2 2 4 1 4
Sample Output
3.00 2.96 3.20
题目链接:点击打开链接
求数学期望的题目, 根据题目概率定义求出第i个球颜色为j的概率, 而后根据题目给出的贡献计算期望.
AC代码:
#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
#include "list"
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = 1005;
int n, m;
double a[MAXN][MAXN], p[MAXN][MAXN];
int main(int argc, char const *argv[])
{
while(scanf("%d%d", &n, &m) != EOF) {
for(int i = 0; i < n; ++i) {
double sum = 0;
for(int j = 0; j < m; ++j) {
scanf("%lf", &a[i][j]);
sum += a[i][j];
}
for(int j = 0; j < m; ++j)
p[i][j] = a[i][j] / sum;
}
double ans = 0;
for(int j = 0; j < m; ++j) {
double sum = 0;
for(int i = 0; i < n; ++i)
ans += p[i][j] * (1.0 - p[i][j]);
for(int i = 0; i < n; ++i)
sum += p[i][j];
ans += sum * sum;
}
printf("%.2lf\n", ans);
}
return 0;
}