数论模板

Do more with less

欧几里德算法（辗转相除法）

int gcd(int a, int b)
{
    return b ==  0 ? a : gcd(b, a%b);
}

唯一分解定理

int judge(int *x)
{
    x[2] /= gec(x[2],x[1]);
    for(int i = 2; i <= k; i ++)
        x[2] /= gcd(x[i],x[2]);
}

扩展欧几里德

void gcd(int a, int b, int &d, int &x, int &y)
{
    if(!b)
    {
        d = a;
        x = 1;
        y = 0;  
    ｝   
    else
    {
        gcd(b, a%b, y, x);
        y -= x * (a/b);
    }
}

Eratosthenes筛法

void eratosthenes()
{
    memset(prime,true,sizeof(prime));
    prime[0]=prime[1]=false;
    for(int i=2;i<=sqrt(N);i++)
        if(prime[i])
            for(int j=i*i;j<N;j+=i)
                prime[j]=false;

}

模算术公式

$(a+b)modn = ((a modn)+(bmodn)) modn$
$(a - b)modn = ((a modn)-(bmodn)+n) modn$
$abmodn = (amod n ) ( b mod n)mod n$

int mul_mod(int a, int b, int n)
{
    a %= n;
    b %= n;
    return (int)((long long )a * b % n);
}

大整数取模

int main()
{
    char n[MAXN];
    int m;
    scanf("%d", n, &m);
    int len = strlen(n);
    int sns = 0;
    for(int i = 0; i < len; i ++)
        ans = (int )(((long long)ans*10 +n[i]- '0')%m);
    printf("%d\n");
    return 0;
}

幂取模(快速幂）

int pow_mod(int a, int n, int m)
{
    int ans = 1;
    for(int i = 0; i < n; i ++)
        ans = (int)((long long)ans * a % m);
}

幂取模（递归写法）

int pow_mod(int a, int n, int  m)
{
    if(n == 0)
        return 1;
    int x = pow_mod(a, n/2, m);
    long long ans = (long long )x * x % m;
    if(n%2 == 1)
        ans = ans *a % m;
    return (int )ans;
}

快速幂（非递归）

LL pow_mod(LL a, LL b, LL p){//a的b次方求余p 
    LL ret = 1;
    while(b){
        if(b & 1) ret = (ret * a) % p;
        a = (a * a) % p;
        b >>= 1;
    }
    return ret;
}

快乘

LL mul(LL a, LL b, LL p){//快速乘，计算a*b%p 
    LL ret = 0;
    while(b){
        if(b & 1) ret = (ret + a) % p;
        a = (a << 1) % p;
        b >>= 1;
    }
    return ret;
}

欧拉函数

int euler(int x) 
{
     int i, res = x;
     for (i = 2;i < (int)sqrt(x * 1.0) + 1; i++)
         if(x % i == 0) 
         {
            res = res / i * (i - 1);
            while(x % i == 0) 
                x /= i; // 保证 i 一定是素数
         }
     if(x > 1)
        res = res / x * (x - 1);
     return res;
} 

中国剩余定理

//n个方程：x=a[i](mod m[i]) (0<=i<n)
LL china(int n, LL *a, LL *m){
    LL M = 1, ret = 0;
    for(int i = 0; i < n; i ++) M *= m[i];
    for(int i = 0; i < n; i ++){
        LL w = M / m[i];
        ret = (ret + w * inv(w, m[i]) * a[i]) % M;
    }
    return (ret + M) % M;
}