UVA 11722 - Joining with Friend(概率)
来源:互联网 发布:在淘宝搜血滴子 编辑:程序博客网 时间:2024/05/14 12:16
UVA 11722 - Joining with Friend
题目链接
题意:你会在[t1,t2]时刻到,你朋友会在[s1,s2]时刻到,两个人都停留w,问两人碰面的概率
思路:概率题,画图,计算围成面积/总面积就是概率
代码:
#include <stdio.h>#include <string.h>int t;double t1, t2, s1, s2, w;double cal(double w) {double ly = t1 + w;double ry = t2 + w;double ux = s2 - w;double dx = s1 - w;if (ly >= s2) return 0;if (ry <= s1) return (t2 - t1) * (s2 - s1); bool isleft = (ly >= s1 && ly <= s2);bool isright = (ry >= s1 && ry <= s2);bool isup = (ux >= t1 && ux <= t2);bool isdown = (dx >= t1 && dx <= t2);if (isleft && isup) return (ux - t1) * (s2 - ly) * 0.5;if (isleft && isright) return (s2 - ly + s2 - ry) * (t2 - t1) * 0.5;if (isdown && isright) return (t2 - t1) * (s2 - s1) - (t2 - dx) * (ry - s1) * 0.5;if (isdown && isup) return (ux - t1 + dx - t1) * (s2 - s1) * 0.5;}int main() {int cas = 0;scanf("%d", &t);while (t--) {scanf("%lf%lf%lf%lf%lf", &t1, &t2, &s1, &s2, &w);printf("Case #%d: %.7lf\n", ++cas, (cal(-w) - cal(w)) / (t2 - t1) /(s2 - s1));}return 0;}
1 0
- UVA 11722 - Joining with Friend(概率)
- uva 11722 - Joining with Friend(概率)
- UVA - 11722 Joining with Friend (概率)
- UVA 11722 Joining with Friend【概率】
- UVA 11722 Joining with Friend 图形面积+概率
- UVa 11722 - Joining with Friend (概率 数形结合)
- UVA 11722 Joining with Friend 概率与期望
- UVA 11722 Joining with Friend
- UVA 11722 Joining with Friend
- Uva11722 joining with friend 概率 几何计算
- Uva11722 Joining with Friend
- uva11722 Joining with Friend
- UVA11722Joining with Friend概率dp
- UVA 11722 概率几何
- uva 11722 通过面积比算概率
- 概率(和朋友会面,UVA 11722)
- uva 11181(条件概率)
- uva 11427 数学-概率
- 谈谈几个编程习惯
- 周鸿祎:人人需要Mentor,世界没有奇迹
- C#lock C#lock(this)
- ArrayList 根据某一属性排序
- java 数据压缩
- UVA 11722 - Joining with Friend(概率)
- 网络基础知识及协议
- Mobile 编译 运行 java 文件步骤
- 文章收藏
- Python中subprocess模块的使用
- 解决ScrollView嵌套ViewPager出现的滑动冲突问题
- Enumeration (C)
- 数据库主外键之NULL值
- 总线初始化及/sys下bus目录的建立