Lucas模板 hdu3037
来源:互联网 发布:苏宁易购淘宝旗舰店 编辑:程序博客网 时间:2024/06/07 03:07
Saving Beans
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5751 Accepted Submission(s): 2306
Problem Description
Although winter is far away, squirrels have to work day and night to save beans. They need plenty of food to get through those long cold days. After some time the squirrel family thinks that they have to solve a problem. They suppose that they will save beans in n different trees. However, since the food is not sufficient nowadays, they will get no more than m beans. They want to know that how many ways there are to save no more than m beans (they are the same) in n trees.
Now they turn to you for help, you should give them the answer. The result may be extremely huge; you should output the result modulo p, because squirrels can’t recognize large numbers.
Now they turn to you for help, you should give them the answer. The result may be extremely huge; you should output the result modulo p, because squirrels can’t recognize large numbers.
Input
The first line contains one integer T, means the number of cases.
Then followed T lines, each line contains three integers n, m, p, means that squirrels will save no more than m same beans in n different trees, 1 <= n, m <= 1000000000, 1 < p < 100000 and p is guaranteed to be a prime.
Then followed T lines, each line contains three integers n, m, p, means that squirrels will save no more than m same beans in n different trees, 1 <= n, m <= 1000000000, 1 < p < 100000 and p is guaranteed to be a prime.
Output
You should output the answer modulo p.
Sample Input
21 2 52 1 5
Sample Output
33HintHintFor sample 1, squirrels will put no more than 2 beans in one tree. Since trees are different, we can label them as 1, 2 … and so on. The 3 ways are: put no beans, put 1 bean in tree 1 and put 2 beans in tree 1. For sample 2, the 3 ways are: put no beans, put 1 bean in tree 1 and put 1 bean in tree 2.#include<bits/stdc++.h>#define MAXN 500005#define LL long longusing namespace std;const int N = 2050;const int mod = 1e9+7;LL qpow(LL a,LL b,LL p){ LL ans=1; while(b) { if(b&1) ans=(ans*a)%p; a=(a*a)%p; b>>=1; } return ans;}LL comb(LL n,LL m,LL p){ if(n<m) return 0; if(n==m) return 1; m=min(n-m,m); LL nn=1,mm=1; for(int i=0;i<m;i++) { nn=(nn*(n-i))%p; mm=(mm*(m-i))%p; } return (nn*qpow(mm,p-2,p))%p;}LL lucas(LL n,LL m,LL p){ LL ans=1; while(n&&m&&ans) { ans=(ans*comb(n%p,m%p,p))%p; n/=p; m/=p; } return ans;}int main(){ int t; scanf("%d",&t); while(t--) { LL a,b,p; scanf("%lld%lld%lld",&a,&b,&p); printf("%lld\n",lucas(a+b,b,p)); } return 0;}
阅读全文
0 0
- Lucas模板 hdu3037
- 数论 Lucas定理 hdu3037
- HDU3037(Lucas定理)
- hdu3037 LUCAS定理运用。
- Lucas定理&&hdu3037
- lucas定理(hdu3037,)
- 【hdu3037】【Lucas定理】Saving Beans
- hdu3037 lucas 定理 组合数取模
- Hdu3037 Saving Beans Lucas定理
- hdu3037 组合数 lucas定理
- HDU3037——Saving Beans(数论,组合数取模,lucas定理模板)
- hdu3037 大组合数取模(Lucas定理)
- 组合数取模(sdut3895+HDU3037)逆元法或Lucas
- HDU3037(Lucas定理求大组合数取模)
- 组合数取模(sdut3895+HDU3037)逆元法或Lucas
- HDU3037
- 【日常学习】【组合数取模Lucas定理】HDU3037 Saving Beans题解
- hdu3037 Saving Beans (lucas定理+组合数公式)
- eclipse中 Unable to read repository at http://download.eclipse.org/releases/indigo 解决方案
- Android UI根据屏幕分辨率决定加载布局
- Android选择控件,CheckBox和RadioButton使用大全
- calc()实现CSS响应式布局
- 2017 Multi-University Training Contest
- Lucas模板 hdu3037
- MyBatis + Spring Boot
- 关于java调用js,document不能用问题
- 大顶堆和小顶堆--Java版
- 静默安装oracle11g
- react-navigation的使用
- HDOJ1412 排序水题
- JVM分为哪些区,每一个区干吗的?
- 卷积神经网络CNN(基础理论)