组合数小结

基本用法。

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#define PI acos(-1.0)
#define MOD 1000000009
#define INF 0x3f3f3f3f
#define Lowbit(x) (x & (-x))
#define mem(a,x) memset(a,x,sizeof(a))
#define Read()  freopen("in.txt", "r", stdin);
#define Write() freopen("out.txt", "w", stdout);
#define bitnum(a) __builtin_popcount(a)
using namespace std;
typedef long long int ll;
inline int in()
{
    ll res=0;char c;ll f=1;
    while((c=getchar())<'0' || c>'9')if(c=='-')f=-1;
    while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
    return res*f;
}

const int maxn = 10001;
ll C[maxn][maxn];
ll CC[maxn];
void combination(int n){ // O(n^2)
    mem(C,0);
    for(int i=0;i<=n;i++){
        C[i][0] = 1;
        for(int j=1;j<=i;j++){
            C[i][j] = C[i-1][j-1] + C[i-1][j];
        }
    }
}
// C (k ,n) = (n-k+1) / k * C(k-1,n) 递推公式
//只计算某一行的二项式系数
void combination1(int n){
    CC[0] = 1;
    for(int i=1;i<=n;i++) CC[i] = CC[i-1] *(n-i+1)/i;
    //注意是否爆longlong
}

//组合数取模 p为素数
const int N = 1000005;
const int mod = 1000000007;
ll fac[N];
void init(){
    fac[0] = 1;
    for(int i=1;i<=N;i++){
        fac[i] = i * fac[i-1] % mod;
    }
}
ll pow_mod(ll a,ll b){
    ll res = 1;
    a = a %mod;
    while(b){
        if(b & 1) res = res * a % mod;
        a = a*a % mod;
        b >>= 1;
    }
    return res;
}
ll CCC(ll n, ll m){
    if(m>n)
        return 0;
    return  fac[n]*pow_mod(fac[m]*fac[n-m]%mod,mod-2)%mod;
}
ll Lucas(ll n,ll m)
{
    if(m==0)
        return 1;
    return CCC(n%mod,m%mod)*Lucas(n/mod,m/mod)%mod;
}
int main(){
    int n;
    while(cin>>n){
         combination(n);
         for(int i=0;i<=n;i++){
            for(int j=0;j<=n;j++){
                cout<<C[i][j]<<" ";
            }
            cout<<endl;
         }
         combination1(n);
         for(int i=0;i<=n;i++)
            cout<<CC[i]<<" ";
         cout<<endl;

         //组合数取模
         init();
         cout<<Lucas(3,2)<<endl;
         cout<<Lucas(4,2)<<endl;
         cout<<Lucas(5,2)<<endl;
         cout<<Lucas(6,2)<<endl;
         cout<<Lucas(7,2)<<endl;
    }

    return 0;
}

当n ，m较大的时候，不能提前用fac存好阶乘了，爆内存

http://acm.fzu.edu.cn/problem.php?pid=2020

#include <iostream>  
#include <string.h>  
#include <stdio.h>  
  
using namespace std;  
typedef long long LL;  
  
LL n,m,p;  
  
LL quick_mod(LL a, LL b)  
{  
    LL ans = 1;  
    a %= p;  
    while(b)  
    {  
        if(b & 1)  
        {  
            ans = ans * a % p;  
            b--;  
        }  
        b >>= 1;  
        a = a * a % p;  
    }  
    return ans;  
}  
  
LL C(LL n, LL m)  
{  
    if(m > n) return 0;  
    LL ans = 1;  
    for(int i=1; i<=m; i++)  
    {  
        LL a = (n + i - m) % p;  
        LL b = i % p;  
        ans = ans * (a * quick_mod(b, p-2) % p) % p;  
    }  
    return ans;  
}  
  
LL Lucas(LL n, LL m)  
{  
    if(m == 0) return 1;  
    return C(n % p, m % p) * Lucas(n / p, m / p) % p;  
}  
  
int main()  
{  
    int T;  
    scanf("%d", &T);  
    while(T--)  
    {  
        scanf("%I64d%I64d%I64d", &n, &m, &p);  
        printf("%I64d\n", Lucas(n,m));  
    }  
    return 0;  
}