wenbao与模板

#define LL long long
//快速幂 a^p%Mod
LL pow_mod(LL a, LL p, LL Mod){
    LL X = 1LL;
    if(a == 0) return 0;
    while(p){
        if(p&1) X = X*a%Mod;
        a = a*a%Mod;
        p >>= 1;
    }
    return X;
}
//扩展欧几里得
void gcd(LL a, LL b, LL& d, LL& x, LL& y){
    if(!b) { d = a, x = 1, y = 0;}
    else { gcd(b, a%b, d, y, x); y -= x*(a/b);}
}
//计算模n下a的逆
//第一种利用GCD
LL inv(LL a, LL n){
    LL d, x, y;
    gcd(a, n, d, x, y);
    return d == 1 ? (x+n)%n : -1;
}
//第二种利用欧拉定理
//pow_mod(a, n-2, n)

 KMP

const int maxn = 1e5+10;
int Next[maxn];
int KMP(char* aim, char* str){
    memset(Next, 0, sizeof(Next));
    int num = 0, len = strlen(aim), Len = strlen(str);
    for(int i = 1; i < len; i++){
        int j = Next[i];
        while(j && aim[i] != aim[j]) j = Next[j];
        Next[i+1] = (aim[i] == aim[j]) ? j+1 : 0;
    }
    int j = 0;
    for(int i = 0; i < Len; i++){
        while(j && aim[j] != str[i]) j = Next[j];
        if(aim[j] == str[i]) j++;
        if(j == len) num++;
    }
    return num;
}

欧拉筛

const int maxn = 1e5+10;
int p[maxn], phi[maxn];
bool vis[maxn];
int Euler(int n){
    int i, j, k;
    phi[1] = 1;
    for (int i = 2; i < n; ++i){
        if (!vis[i]){
            p[cnt++] = i;
            phi[i] = i - 1;
        }
        for (int j = 0; j < cnt && i * p[j] < n; ++j){
            vis[i * p[j]] = true;
            if (i % p[j]) phi[i * p[j]] = phi[i] * phi[p[j]];
            else {
                phi[i * p[j]] = phi[i] * p[j];
                break;
            }
        }
    }
    return cnt;
}

输入输出外挂

int read(){
    int x=0,f=1,ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0',ch=getchar();}
    return x*f;
}
void out(int x){
    if(x > 9) out(x/10);
    putchar(x%10+'0');
}

测试时间

 printf("%.3lf ", (double)clock()/CLOCKS_PER_SEC); 

struct Node{
    ll x[16][16];
};
Node mul(Node xx, Node yy){
    Node X;
    for(int i = 0; i < d; ++i){
        for(int j = 0; j < d; ++j){
            X.x[i][j] = 0;
            for(int k = 0; k < d; ++k){
                X.x[i][j] = (X.x[i][j] + (xx.x[i][k]*yy.x[k][j])%m) % m;
            }
        }
    }
    return X;
}
Node q_m(Node A, ll x){
    Node AAA;
    for(int i = 0; i < d; ++i){
        for(int j = 0; j < d; ++j){
            AAA.x[i][j] = (i == j);
            //printf("%lld ", AAA.x[i][j]);
        }
        //puts("");
    }
    while(x){
        if(x&1) AAA = mul(AAA, A);
        A = mul(A, A);
        x >>= 1;
    }
    return AAA;
}

只有不断学习才能进步！