Codeforces 454C Little Pony and Expected Maximum 简单期望
来源:互联网 发布:淘宝买iphone7可靠吗 编辑:程序博客网 时间:2024/05/02 06:29
点击打开链接
题意:给你一个m面的色子,投n次,求出最大点数的期望值
先求最大值为i的概率=pi=E/S S=m^n
最大值为i:n次都小于等于i中-i一次都没出现 i^n-(i-1)^n
幂n<=1e5太大 化解p[i]=pow(1.0*i/m,n)-pow(1.0*(i-1)/m,n)即可
#include <bits/stdc++.h>using namespace std;typedef long long ll;const int N=2e5+20;double p[N];//p[i]:n次摇到最大值为i的概率 int main(){double m,n;while(cin>>m>>n){//m face n times;double s=pow(m,n);double ans=0;for(int i=1;i<=m;i++){p[i]=pow(1.0*i/m,n)-pow(1.0*(i-1)/m,n);ans+=p[i]*i;}printf("%.10lf\n",ans);}return 0;}
0 0
- Codeforces 454C Little Pony and Expected Maximum 简单期望
- CODEFORCES 454C Little Pony and Expected Maximum
- Codeforces 453A Little Pony and Expected Maximum(期望)
- codeforces 453A Little Pony and Expected Maximum 最大值期望
- Codeforces 453A Little Pony and Expected Maximum 概率期望
- codeforces 453A Little Pony and Expected Maximum(期望)
- 454C. Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 2)C. Little Pony and Expected Maximum(数学期望)
- Codeforces Round #259 (Div. 2) C. Little Pony and Expected Maximum(期望)
- Codeforces #259 (Div. 2) C. Little Pony and Expected Maximum
- Codeforces Div. 2 #259-C. Little Pony and Expected Maximum
- Little Pony and Expected Maximum CodeForces
- C. Little Pony and Expected Maximum
- C - Little Pony and Expected Maximum
- CodeForces 454C Little Pony and Expected Maximum (数学推导)
- codeforces 453A. Little Pony and Expected Maximum (概率与期望+快速幂)
- 【CF 453A】 Little Pony and Expected Maximum (最大期望)
- Little Pony and Expected Maximum
- 区块链开发(八)从歪曲的比特币谈区块链应用及误区
- resin安装和配置
- leetcode242
- 回归相关的算法
- 车辆限号js代码
- Codeforces 454C Little Pony and Expected Maximum 简单期望
- 常用数据操作语句
- count(*)、count(1)、count(column)的区别
- 关于使用eclipse创建Android程序时会多出一个appcompat_v7
- iOS企业证书申请(包含第二个应用申请流程)
- Andriod内存泄漏的几种工具和方法
- cudnn7.5 安装命令
- SOQL select *
- 数据库面试题(一)