UVa 10375 Choose and divide
思路:
排列组合。
#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; }
-------------------------------------------------------
kedebug
Department of Computer Science and Engineering,
Shanghai Jiao Tong University
E-mail: kedebug0@gmail.com
GitHub: http://github.com/kedebug
-------------------------------------------------------
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步