当前位置:网站首页>求组合数 AcWing 887. 求组合数 III
求组合数 AcWing 887. 求组合数 III
2022-07-05 06:16:00 【T_Y_F666】
求组合数 AcWing 887. 求组合数 III
原题链接
算法标签
组合数学 组合计数 Lucas定理 逆元 快速幂 费马小定理
思路
代码
#include<bits/stdc++.h>
#define int long long
#define abs fabs
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>=b;--i)
using namespace std;
const int N = 105;
double a[N][N], eps = 1e-8;
int n;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
void put(int x) {
if(x<0) putchar('-'),x=-x;
if(x>=10) put(x/10);
putchar(x%10^48);
}
int qmi(int a, int b, int p){
int ans=1;
while(b){
if(b&1){
ans=ans*a%p;
}
a=a*a%p;
b>>=1;
}
return ans;
}
int C(int a, int b, int p){
if(a<b){
return 0;
}else{
int res=1;
// for循环只执行了b次,所以是从a开始乘了b个数,即a*(a-1)*…*(a-b+1),也就等于a!/(a-b)!
for(int i=1, j=a; i<=b; ++i, --j){
res=res*j%p;
res=res*qmi(i, p-2, p)%p;
}
return res;
}
}
int lu(int a, int b, int p){
if(a<p&&b<p){
return C(a, b, p);
}else{
return C(a%p, b%p, p)*lu(a/p, b/p, p)%p;
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
n=read();
while(n--){
int a=read(), b=read(), p=read();
printf("%lld\n", lu(a, b, p));
}
}
原创不易
转载请标明出处
如果对你有所帮助 别忘啦点赞支持哈
边栏推荐
- 做 SQL 性能优化真是让人干瞪眼
- 1.15 - input and output system
- 1039 Course List for Student
- LeetCode 0108. Convert an ordered array into a binary search tree - the median of the array is the root, and the left and right of the median are the left and right subtrees respectively
- 1040 Longest Symmetric String
- Sqlmap tutorial (II) practical skills I
- Daily question 1189 Maximum number of "balloons"
- Usage scenarios of golang context
- Operator priority, one catch, no doubt
- Chart. JS - Format Y axis - chart js - Formatting Y axis
猜你喜欢
Navicat連接Oracle數據庫報錯ORA-28547或ORA-03135
高斯消元 AcWing 884. 高斯消元解异或线性方程组
【LeetCode】Easy | 20. Valid parentheses
MySQL advanced part 2: optimizing SQL steps
MySQL advanced part 2: storage engine
Appium automation test foundation - Summary of appium test environment construction
Quickly use Amazon memorydb and build your own redis memory database
Leetcode-6110: number of incremental paths in the grid graph
背包问题 AcWing 9. 分组背包问题
什么是套接字?Socket基本介绍
随机推荐
1040 Longest Symmetric String
Operator priority, one catch, no doubt
【Rust 笔记】14-集合(下)
927. 三等分 模拟
[BMZCTF-pwn] ectf-2014 seddit
Leetcode-9: palindromes
Nested method, calculation attribute is not applicable, use methods
1041 Be Unique
Leetcode dynamic programming
博弈论 AcWing 894. 拆分-Nim游戏
Basic explanation of typescript
Simple selection sort of selection sort
CPU内核和逻辑处理器的区别
LeetCode 1200. Minimum absolute difference
Shutter web hardware keyboard monitoring
MIT-6874-Deep Learning in the Life Sciences Week 7
Real time clock (RTC)
1039 Course List for Student
In depth analysis of for (VaR I = 0; I < 5; i++) {settimeout (() => console.log (I), 1000)}
MySQL怎么运行的系列(八)14张图说明白MySQL事务原子性和undo日志原理