求组合数

最新推荐文章于 2020-12-05 00:38:14 发布

solego

最新推荐文章于 2020-12-05 00:38:14 发布

阅读量159

点赞数

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/weixin_43900869/article/details/104069227

版权

1. 范围较小. 求 $C_{a}^{b} mod (1e9+7)$ ，共n组询问。 1 ≤ n ≤ 10000, 1 ≤ b ≤ a ≤ 2000

暴力使用杨辉三角即可。f[i][j] = f[i - 1][j - 1] + f[i - 1][j]

2. 仍求第一问的值，但是1 ≤ b ≤ a ≤ $10^_{5}$ ，预处理出 $10^_{5}$ 的逆元和阶乘展开 $C_{a}^{b}$ 即可。

3. $C_{a}^{b} mod (p)$ ，共n组询问。1 ≤ n ≤ 20, 1 ≤ b ≤ a ≤ $10^{18}$ ，1 ≤ p ≤ $10^{5}$ （eg：hdu3944）

Lucas定理： $C_{a}^{b} mod (p) = C_{amodp}^{bmodp} * C_{a/p}^{b/p} mod p$

故时间复杂度为 $\log_{P}N(1) * (P(2) + \log P(3))$

(1)为递归 $\log_{P}N$ 次

(2)为计算每次组合数的时候最多P次

(3)为每次快速幂的次数

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
求组合数

1. 范围较小. 求，共n组询问。 1 ≤ n ≤ 10000, 1 ≤ b ≤ a ≤ 2000暴力使用杨辉三角即可。f[i][j] = f[i - 1][j - 1] + f[i - 1][j]2. 仍求第一问的值，但是1 ≤ b ≤ a ≤，预处理出的逆元和阶乘展开即可。3.，共n组询问。1 ≤ n ≤ 20, 1≤ b≤ a≤，1 ≤ p≤（eg...
复制链接

扫一扫

solego CSDN认证博客专家 CSDN认证企业博客

码龄6年

390: 原创

3万+: 周排名

9130: 总排名

14万+: 访问

: 等级

4759: 积分

344: 粉丝

410: 获赞

72: 评论

446: 收藏

私信

关注

热门文章

分类专栏

最新评论

【偶然一题】CF1979C. Earning on Bets | 思维 | 绕证明绕出来了
bgmaster: 大佬，这个样例跑出来虽然是对的，但是为什么b[i]的和不等于sum 1 2 6 6
关于浏览器打开时自动打开部分网页（浏览器被劫持）的解决办法
zszg: 感谢已解决
Codeforces 1220 D - Alex and Julian
WhiteGrass99: Below is the english translation for the same
Codeforces 1220 D - Alex and Julian
WhiteGrass99: We want to find conditions under which the graph is a bipartite graph, meaning it contains no odd cycles. Therefore, the case of one odd and one even doesn't hold. We aim for both to be odd. To minimize the number of deletions, we express all numbers in B as 2^k * v, where v is an odd number. Only when the exponents k are equal for two numbers, b/gcd(a,b) and a/gcd(a,b) will both be odd. Hence, the retained elements are those with the highest exponents, ranging from 2^0 to 2^63.
Codeforces 1220 D - Alex and Julian
WhiteGrass99: roperty of Bipartite Graph: A graph is bipartite if and only if it does not contain an odd cycle. Utilizing this property, we first consider connecting integers that meet the condition, i.e., when the absolute difference between two integers is in B. For two points a and b existing in B, they can be seen as starting from 0 and advancing forward by a and b steps respectively each time. Therefore, their first meeting point occurs at the least common multiple (LCM) of a and b. At this meeting point, after a has moved b/gcd(a,b) times and b has moved a/gcd(a,b) times, to ensure the absence of an odd cycle, we need the sum of these steps to be divisible by 2. Hence, the problem can be reduced to two cases: Both b/gcd(a,b) and a/gcd(a,b) are odd. One is odd and the other is even. It's impossible for both to be even since if they were both even, it means their denominators can be further divided by 2, contradicting the property of gcd.

大家在看

最新文章

目录

评论

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。