Codeforces 453 A. Little Pony and Expected Maximum
来源:互联网 发布:mac上截取视频的软件 编辑:程序博客网 时间:2024/06/07 19:52
( k / n) ^ m - ( ( k - 1) / n ) ^ m
连续扔m次都<=k的概率-连续扔m次都<k的概率 pow的速度还是非常快的
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;double n,m;int main(){scanf("%lf%lf",&n,&m);double sum=0.;for(int i=1;i<=n;i++){double part=pow(i/n,m)-pow((i-1)/n,m);sum+=part*(double)(i);}printf("%.8lf\n",sum);return 0;}
2 0
- Codeforces 453A Little Pony and Expected Maximum
- Codeforces 453A. Little Pony and Expected Maximum
- Codeforces 453 A. 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 453-A 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
- CodeForces 453A Little Pony and Expected Maximum
- [概率DP] Codeforces 453A Little Pony and Expected Maximum
- Codeforces 453 A. Little Pony and Expected Maximum
- Little Pony and Expected Maximum CodeForces
- A. Little Pony and Expected Maximum
- A. Little Pony and Expected Maximum
- Codeforces 453A Little Pony and Expected Maximum 概率题Orz
- lua学习初探【一】
- 使用EasyWechat开发java微信公众平台应用(二)——发送不同类型的消息
- DNA生物基因植入阻断术的治疗原理
- 补缴2个月社保折腾1年多 刁钻政策玩死人
- 在Linux下生成GUID的程序,及编译错误 “uuid/uuid.h: No such file or directory” 的解决办法。
- Codeforces 453 A. Little Pony and Expected Maximum
- hdu1702 队列与栈
- 浙大超厉害计算机硕士生导师
- 用maven创建基于wink的rest服务-下载zip文件的post请求(五)
- Go语言-Windows开发环境搭建
- java 字符串替换处理方法
- Google搜索技巧
- 对于一个数字,我们可以直观的了解到它所含有的数字,例如: 3243中包含1个2、2个3、1个4。 那么,给你一个数n,求从1到n之间的所有这些数字中,总共包含多少个m。
- Android: 文件操作大全