蓝桥杯算法提高VIP-矩阵乘方 （C语言代码） 明明答案都是对的，还不让过，可恶啊

解题思路:

注意事项:

参考代码:

#include<stdio.h>

int a[4],b[4],m,n;

void juzheng(int s)

{

    int c[4];

    if(s!=1)

    juzheng(s/2);

    if(s%2==1&&s!=1)

    {

        c[1]=((b[1]*a[1])%m+(b[2]*a[3])%m)%m;

        c[2]=((b[1]*a[2])%m+(b[2]*a[4])%m)%m; 

        c[3]=((b[3]*a[1])%m+(b[4]*a[3])%m)%m;

        c[4]=((b[3]*a[2])%m+(b[4]*a[4])%m)%m;

        b[1]=c[1];

        b[2]=c[2];

        b[3]=c[3];

        b[4]=c[4];

    }

    if(s!=n)

    {

        c[1]=((b[1]*b[1])%m+(b[2]*b[3])%m)%m;

        c[2]=((b[1]*b[2])%m+(b[2]*b[4])%m)%m; 

        c[3]=((b[3]*b[1])%m+(b[4]*b[3])%m)%m;

        c[4]=((b[3]*b[2])%m+(b[4]*b[4])%m)%m;

        b[1]=c[1];

        b[2]=c[2];

        b[3]=c[3];

        b[4]=c[4];

    }

}

int main()

{

    int s;

    scanf("%d%d",&n,&m);

    scanf("%d%d%d%d",&a[1],&a[2],&a[3],&a[4]);

    a[1]=a[1]%m;a[2]=a[2]%m;a[3]=a[3]%m;a[4]=a[4]%m;

    b[1]=a[1];b[2]=a[2];b[3]=a[3];b[4]=a[4];

    s=n;

    juzheng(s);

    printf("%d %d\n%d %d\n",b[1],b[2],b[3],b[4]);

}