uva 10375 Choose and divide
来源:互联网 发布:cpu散热器哪个好 知乎 编辑:程序博客网 时间:2024/05/17 00:53
因为结果不大于100,000,000。所以说明C(p,q)和C(r,s)不会差很多,化简一下直接乘除即可,不需要分解质因数。
#include <iostream>#include<stdio.h>using namespace std;int p,q,r,s;double ans,ans1,ans2,ans3;int main(){ while(scanf("%d %d %d %d",&p,&q,&r,&s)!=EOF) { ans = 1; q = min(q,p-q); s = min(s,r-s); for(int i = 1;i <= max(q,s);i++) { if(i <= q) ans=ans/i*(p-q+i); if(i <= s) ans=ans/(r-s+i)*i; } printf("%.5lf\n",ans); } return 0;}
0 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
- linux nkf 日文编码转换命令
- appframework学习--mask toast
- C#数字格式化
- 关于32位系统中int、float、short、double等占多少个字节
- text()、html() 以及 val()
- uva 10375 Choose and divide
- 一个表达式
- asm instnace ASMB
- 华为OJ: 求小球落地5次后所经历的路程和第5次反弹的高度
- AVL树与红黑树(R-B树)的区别与联系
- TOJ 1445. Ants
- 离线安装cloudera manager5.0.2
- ruby中gsub和gsub!的区别
- Hibernate的org.hibernate.hql.internal.ast.tree.PathNode异常