HDOJ 3037 Saving Beans
2015-06-26 20:17
417 查看
如果您有n+1树,文章n+1埋不足一棵树m种子,法国隔C【n+m】【m】
大量的组合,以取mod使用Lucas定理:
Lucas(n,m,p) = C[n%p][m%p] × Lucas(n/p,m/p,p) ;
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2314 Accepted Submission(s): 845
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.
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.
Output
You should output the answer modulo p.
Sample Input
Sample Output
Source
field=problem&key=2009%20Multi-University%20Training%20Contest%2013%20-%20Host%20by%20HIT&source=1&searchmode=source" style="color:rgb(26,92,200); text-decoration:none">2009 Multi-University Training
Contest 13 - Host by HIT
大量的组合,以取mod使用Lucas定理:
Lucas(n,m,p) = C[n%p][m%p] × Lucas(n/p,m/p,p) ;
Saving Beans
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2314 Accepted Submission(s): 845
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.
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.
Output
You should output the answer modulo p.
Sample Input
2 1 2 5 2 1 5
Sample Output
3 3 Hint Hint For 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.
Source
field=problem&key=2009%20Multi-University%20Training%20Contest%2013%20-%20Host%20by%20HIT&source=1&searchmode=source" style="color:rgb(26,92,200); text-decoration:none">2009 Multi-University Training
Contest 13 - Host by HIT
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; typedef long long int LL; LL n,m,p; LL fact[100100]; LL QuickPow(LL x,LL t,LL m) { if(t==0) return 1LL; LL e=x,ret=1LL; while(t) { if(t&1) ret=(ret*e)%m; e=(e*e)%m; t>>=1LL; } return ret%m; } void get_fact(LL p) { fact[0]=1LL; for(int i=1;i<=p+10;i++) fact[i]=(fact[i-1]*i)%p; } LL Lucas(LL n,LL m,LL p) { ///lucas(n,m,p)=c[n%p][m%p]*lucas(n/p,m/p,p); LL ret=1LL; while(n&&m) { LL a=n%p,b=m%p; if(a<b) return 0; ret=(ret*fact[a]*QuickPow((fact[b]*fact[a-b])%p,p-2,p))%p; n/=p; m/=p; } return ret%p; } int main() { int T_T; scanf("%d",&T_T); while(T_T--) { LL n,m,p; cin>>n>>m>>p; get_fact(p); cout<<Lucas(n+m,m,p)<<endl; } return 0; }
相关文章推荐
- JFrame 与 Frame 的区别之一
- pam之基础知识和常见模块
- 大型网站架构体系的演变
- 摧毁自己
- 黑马程序员--c语言数据类型总结
- C++/VC++ 命名及其他规范
- C++模拟C#事件委托机制(二)
- Java线程之run和start的区别
- PHPUnit安装及入门(Unix或者Linux下)
- Objective-C 快速入门--基础(一)
- C++模拟C#事件委托机制(一)
- 代码动态改变 NGUI UILabel 的字体
- [算法]动态规划(Dynamic programming)
- codeforces #309 div2
- dubbox+oceanus
- codeforces #309 div2 分类: codeforces 2015-06-26 20:11 21人阅读 评论(0) 收藏
- STL map使用方法详解
- 不会跳回到微博认定申请书
- 线程通信
- clang: error: linker command failed with exit code 1 (use -v to see invocation)