- 题目类型:概率,直接推公式
- 题目链接
- 题目思路:因为N个人的行为是独立的,所以由期望的线性性质可知EX = E1X1 + E2X2 + … + EnXn,只要求出每个人在k轮中进球的期望 X N就可以了。具体公式可以看代码.PS:可以用数组存储阶乘的值,加速C(n,i)组合函数的计算.
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <cctype>
#include <cmath>
#include <cstring>
#include <climits>
#include <complex>
#include <set>
#include <deque>
#define DEBUG(x) cerr<<"line:"<<__LINE__<<", "<<#x" == "<<(x)<<endl;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define FOR(it,s) for(__typeof(s.begin()) it=s.begin();it!=s.end();it++)
#define ALL(a) a.begin(),a.end()
#define RI(x) scanf("%d",&(x))
#define RII(x,y) scanf("%d%d",&(x),&(y))
#define RIII(x,y,z) scanf("%d%d%d",&(x),&(y),&(z))
#define DRI(x) int (x);scanf("%d",&(x))
#define DRII(x,y) int (x),(y);scanf("%d%d",&(x),&(y))
#define DRIII(x,y,z) int (x),(y),(z);scanf("%d%d%d",&(x),&(y),&(z))
#define MS0(a) memset((a),0,sizeof((a)))
#define MS1(a) memset((a),-1,sizeof((a)))
#define MS(a,b) memset((a),(b),sizeof((a)))
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ULL;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<vi> vvi;
#define INF (int)1e9
#define EPS (1.0e-8)
const int maxn = 100+10;
double jiecheng[maxn];
double c(int n, int i){
if(i == 0) return 1;
else return jiecheng[n] / (jiecheng[i]*jiecheng[n-i]);
}
int main(void)
{
#ifdef LOCAL
#endif
jiecheng[1] = jiecheng[0] = 1;
for(int i = 2; i <= 100; i++){
jiecheng[i] = (double)i * jiecheng[i-1];
}
DRI(t);
for(int kase = 1; kase <= t; kase++){
DRIII(n,m,k);
double p; scanf("%lf", &p);
double res = 0;
for(int i = 1; i <= k; i++){
res += c(k,i)*pow(p,i)*pow((1-p),k-i)*i;
}
res *= n;
printf("Case %d: %lf\n",kase,res);
}
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}