uva 10375 - Choose and divide
来源:互联网 发布:知乎dota2与lol 编辑:程序博客网 时间:2024/05/19 10:38
#include <cstdio>int main(){ int p, q, r, s; while (~scanf("%d %d %d %d", &p, &q, &r, &s)) { if (p - q < q) q = p - q; if (r - s < s) s = r - s; double ret = 1.0; for (int i = 1; i <= q || i <= s; ++i) { if (i <= q) ret = ret * (p - q + i) / i; if (i <= s) ret = ret / (r - s + i) * i; } printf("%.05lf\n", ret); } return 0;}
- UVA 10375 - Choose and divide
- uva 10375 - Choose and divide
- UVA - 10375 Choose and divide
- UVa:10375 Choose and divide
- uva 10375 Choose and divide
- UVA 10375 Choose and divide
- Choose and divide - UVa 10375
- UVA - 10375 Choose and divide
- UVA - 10375 Choose and divide
- UVA - 10375 Choose and divide
- UVa 10375 - Choose and divide
- uva 10375 Choose and divide
- UVa 10375 Choose and divide
- UVA 10375 Choose and divide
- UVa 10375 - Choose and divide
- UVA - 10375 Choose and divide
- uva 10375Choose and divide
- UVA 10375 Choose and divide
- Mono for Android (1) 之布局
- DirectX 3D_实践之DirectX3D中粒子系统的使用
- uva 10056 - What is the Probability ?
- 计算机科学中最重要的32个算法
- GNOME窗口管理器
- uva 10375 - Choose and divide
- 如何解决终端服务器超出了最大允许连接数
- 正则表达式
- python中参数的传递的list形式和dict的区分
- Blink, 通向哈里·波特的魔法世界
- 数据结构_图_prim最小生成树算法
- [C++STDlib基础]关于字符串的操作——C++标准库头文件<cstring>
- hdu 2108 Shape of HDU(判断多边形是否为凸多边形)
- 用复数value一次给数据库插入多条记录