codevs 1250

再一道矩乘。。没想到矩乘是这么用的。。我的数论还是太弱

#include<bits/stdc++.h>
#define inc(i,l,r) for(i=l;i<=r;i++)
#define dec(i,l,r) for(i=l;i>=r;i--)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define succ(x) (1<<x)
#define NM 3
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct matrix{
    int n,m,a[NM][NM];
}a,b,tmp;
int n,m,T,inf;
matrix operator*(const matrix&x,const matrix&y){
    matrix s;
    int i,j,k;
    inc(i,1,x.n)
    inc(j,1,y.m){
        s.a[i][j]=0;
        inc(k,1,x.m)
        (s.a[i][j]+=x.a[i][k]*y.a[k][j])%=inf;
    }
    s.n=x.n;s.m=y.m;
    return s;
}
matrix mul(int k){
    matrix s=a,t=a;
    k--;
    while(k>0){
        if(k%2)s=s*t;
        t=t*t;k/=2;
    }
    return s;
}
int main(){
    T=read();
    a.n=a.m=2;a.a[1][1]=0;a.a[1][2]=a.a[2][1]=a.a[2][2]=1;
    b.n=2;b.m=1;
    while(T--){
        n=read();inf=read();
        if(n<=1){
            printf("%d
",1%inf);
            continue;
        }
        tmp=mul(n-1);
        b.a[1][1]=b.a[2][1]=1;
        b=tmp*b;
        printf("%d
",b.a[2][1]);
    }
    return 0;
}