组合数取模

复习了一下组合数取模，当然推荐查看ACDreamer的博客啦，写的确实好啦，自己把里面的题目全A掉了。

原文地址：http://blog.csdn.net/acdreamers/article/details/8037918

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

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, m, p;

ll power_mod(ll a, ll b) {
    ll res = 1;
    while(b) {
        if(b&1) res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}

ll C(ll n, ll m) {
    if(n == m) return 1;
    if(n < m) 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 * power_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;
}

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=628

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 200010;
bool is_prime[maxn];
ll  prime[maxn];
int len;

void init() {
    int i, j;
    len = 0;
    memset(is_prime, true, sizeof(is_prime));
    prime[len++] = 2;
    for(i = 4; i < maxn; i += 2) is_prime[i] = false;
    for(i = 3; i * i <= maxn; i += 2) {
        if(is_prime[i]) {
            prime[len++] = i;
            for(j = i * i; j < maxn; j += i) {
                is_prime[j] = false;
            }
        }
    }
    for( ; i < maxn; i += 2) {
        if(is_prime[i]) {
            prime[len++] = i;
        }
    }
}

ll get_num_p(ll n, ll p) {
    ll ans = 0;
    while(n) {
        ans += n / p;
        n /= p;
    }
    return ans;
}

ll power_mod(ll a, ll b, ll c) {
    ll res = 1;
    while(b) {
        if(b&1) res = res * a % c;
        a = a * a % c;
        b >>= 1;
    }
    return res;
}

ll solve(ll n, ll m, ll p) {
    ll ans = 1;
    for(int i = 0; i < len && prime[i] <= n; ++i) {
        ll c1 = get_num_p(n, prime[i]);
        ll c2 = get_num_p(m, prime[i]);
        ll c3 = get_num_p(n - m, prime[i]);
        ans = ans * power_mod(prime[i], c1 - c2 - c3, p) % p;
    }
    return ans % p;
}

int main() {

    init();
    int T;
    ll n, m, p;
    //cin >> T;
    scanf("%d", &T);
    while(T--) {
        cin >> n >> m >> p;
        // n + m - 2 <= 200000 数组开小了
        cout << solve(n + m - 2, m - 1, p) << endl;
        //scanf("%I64d %I64d %I64d", &n, &m, &p);
        //printf("%I64d\n", solve(n + m - 2, m - 1, p));
    }
    return 0;
}

http://acm.hdu.edu.cn/showproblem.php?pid=3944

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 10010;
bool is_prime[maxn];
int  fac[maxn][maxn]; // 阶乘取模
int  inv[maxn][maxn]; // 逆元

int power_mod(int a, int b, int c) {
    int res = 1;
    while(b) {
        if(b&1) res = res * a % c;
        a = a * a % c;
        b >>= 1;
    }
    return res;
}

void init() {
    memset(is_prime, true, sizeof(is_prime));
    for(int i = 4; i < maxn; i += 2) {
        is_prime[i] = false;
    }
    for(int i = 3; i * i <= maxn; i += 2) {
        if(is_prime[i]) {
            for(int j = i * i; j < maxn; j += i) {
                is_prime[j] = false;
            }
        }
    }
    for(int i = 2; i < maxn; ++i) {
        if(is_prime[i]) {
            fac[i][0] = inv[i][0] = 1;
            for(int j = 1; j < i; ++j) {
                fac[i][j] = fac[i][j-1]*j%i;
                inv[i][j] = power_mod(fac[i][j], i - 2, i);
            }
        }
    }
}

int C(int n, int m, int p) {
    if(m > n) return 0;
    if(m == 0 || m == n) return 1;
    if(m == 1 || m == n - 1) return n;  // n , m < p
    return fac[p][n]*(inv[p][m]*inv[p][n-m]%p)%p;
}

int Lucas(int n, int m, int p) {
    if(m == 0) return 1;
    return C(n%p, m%p, p)*Lucas(n/p, m/p, p)%p;
}

int main() {

    //freopen("aa.in", "r", stdin);

    init();
    int n, m, p;
    int kcase = 0;
    while(scanf("%d %d %d", &n, &m, &p) != EOF) {
        kcase++;
        if(n > 2 * m) {
            printf("Case #%d: %d\n", kcase, (Lucas(n+1, m, p)+n-m)%p);
        } else {
            printf("Case #%d: %d\n", kcase, (Lucas(n+1, m+1, p)+m)%p);
        }
    }
    return 0;
}

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4536

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, m, p;

ll power_mod(ll a, ll b) {
    ll res = 1;
    while(b) {
        if(b&1) res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}

ll C(ll n, ll m) {
    if(n == m) return 1;
    if(n < m) 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 * power_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() {

    while(cin >> n >> m >> p) {
        if(n - m + 1 < m) {
            //printf("0\n");
            cout << "0" << endl;
        } else {
            cout << Lucas(n - m + 1, m) << endl;
            //printf("%I64d\n", Lucas(n-m+1, m));
        }
    }
    return 0;
}

http://acm.hdu.edu.cn/showproblem.php?pid=4349

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

/*
    求解C(n,0),C(n,1)....C(n,n)中C(n,m)为奇数的个数

    结论：当C(n,m)为奇数时 n&m == m

    因此我们需要的求解的是0->n中存在多少个m使得n&m=m
*/


int main() {

    int n;
    while(scanf("%d", &n) != EOF) {
        int bit = 0;
        while(n) {
            bit += n&1;
            n >>= 1;
        }
        cout << (1<<bit) << endl;
    }
    return 0;
}