UVA - 10375 Choose and divide
2015-03-17 23:57
274 查看
题目大意:给出p,q,s和r, 计算C(p, q) / C(s, r), 公式题目已经给出。
解题思路:以为C(p,q) = C(p,p - q), 所以要尽量选择计算量交少的,边乘边除。
解题思路:以为C(p,q) = C(p,p - q), 所以要尽量选择计算量交少的,边乘边除。
#include <cstdio> #define min(a,b) (a)<(b)?(a):(b) int main() { int p, q, r, s; while (scanf("%d%d%d%d", &p, &q, &r, &s) != EOF) { q = min(q, p - q); s = min(s, r - s); double ans = 1.0; for (int i = 1; i <= q || i <= s; i++) { if (i <= q) ans = ans * (p - q + i) / i; if (i <= s) ans = ans / (r - s + i) * i; } printf("%.05lf\n", ans); } return 0; }
相关文章推荐
- 【暑假】[数学]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 (唯一分解定理)
- Choose and divide UVA - 10375
- Choose and divide唯一分解定理/分解/直接 UVA - 10375
- UVa 10375 Choose and divide
- UVA - 10375 Choose and divide 唯一分解定理
- Choose and divide UVA - 10375——埃式筛法+组合数阶乘运算
- 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