621C. Wet Shark and Flowers【概率】
来源:互联网 发布:讲诚信 知礼仪 编辑:程序博客网 时间:2024/06/05 07:59
题目链接
http://codeforces.com/problemset/problem/621/C
思路
设
最后求
AC代码
#include <iostream>#include <cstdio>using namespace std;int l[100000+100],r[100000+100];int main(){ int n,p; scanf("%d%d",&n,&p); for(int i=1 ; i<=n ; ++i) { scanf("%d%d",&l[i],&r[i]); } double sum=0; for(int i=1 ; i<=n ; ++i) { int j=i+1; if(i==n) j=1; int ai=r[i]/p-(l[i]-1)/p,aj=r[j]/p-(l[j]-1)/p; sum+=(1-(double)(r[i]-l[i]+1-ai)/(r[i]-l[i]+1) *(double)(r[j]-l[j]+1-aj)/(r[j]-l[j]+1))*2000; } printf("%.10f\n",sum); return 0;}
0 0
- 621C. Wet Shark and Flowers【概率】
- 【概率与期望】[CodeForces - 621C]Wet Shark and Flowers
- Codeforces 621C Wet Shark and Flowers
- codeforce 621C Wet Shark and Flowers
- CodeForces 621C Wet Shark and Flowers
- cf#341-C. Wet Shark and Flowers-数学-概率计算
- Codeforces #341 div2 C.Wet Shark and Flowers(概率)
- Codeforce 题目621C Wet Shark and Flowers(期望)
- Codeforces 621C Wet Shark and Flowers 【期望】
- CodeForces 621 C. Wet Shark and Flowers(期望)
- 612 C. Wet Shark and Flowers
- Codeforces 621B Wet Shark and Flowers
- Codeforces Round #341 (Div. 2)-C. Wet Shark and Flowers(区间概率)
- Codeforces Round #341 (Div. 2) C Wet Shark and Flowers - 期望与概率
- CF621C - Wet Shark and Flowers
- Codeforces Round #341 (Div. 2) C. Wet Shark and Flowers
- Codeforces #341 C. Wet Shark and Flowers 概率论
- Codeforces Round #341 (Div. 2)--C. Wet Shark and Flowers
- 正确认识SQL Server中的模糊查询LIKE
- Android 第九天(晚上)
- 【机房重构】——七层登陆代码分析
- 四川成都电信天邑TEWA-300AI EPON光猫各种折腾
- 树和二叉树
- 621C. Wet Shark and Flowers【概率】
- 加载大图到应用内存时所需的缩放步骤
- hdu2037 今年暑假不AC(贪心||暴力)
- Python教程学习简记5--Python 列表生成式(List Comprehensions)
- linux yum源讲解
- 使用二分法猜1到100之间的一个数最多需要几次猜对
- Spring的事务管理
- UBIFS 白皮书 -- UBIFS设计简介
- Java 自定义注解详解