UVA 10689 Yet another Number Sequence

简单矩阵快速幂。

if(m==1) MOD=10;
if(m==2) MOD=100;
if(m==3) MOD=1000;
if(m==4) MOD=10000;

剩下的就是矩阵快速幂求斐波那契数列第n项取模

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
 
long long MOD;
long long x, y;
int n,m;
 
long long mod(long long a, long long b)
{
    if (a >= ) return a%b;
    if (abs(a) % b == ) return ;
    return (a + b*(abs(a) / b + ));
}
 
struct Matrix
{
    long long A[][];
    int R, C;
    Matrix operator*(Matrix b);
};
 
Matrix X, Y, Z;
 
Matrix Matrix::operator*(Matrix b)
{
    Matrix c;
    memset(c.A, , sizeof(c.A));
    int i, j, k;
    for (i = ; i <= R; i++)
        for (j = ; j <= C; j++)
            for (k = ; k <= C; k++)
                c.A[i][j] = mod((c.A[i][j] + mod(A[i][k] * b.A[k][j], MOD)), MOD);
    c.R=R; c.C=b.C;
    return c;
}
 
void read()
{
    scanf("%lld%lld%d%d", &x, &y, &n,&m);
    if(m==) MOD=;
    if(m==) MOD=;
    if(m==) MOD=;
    if(m==) MOD=;
}
 
void init()
{
   // n = n - 1;
    Z.A[][] = x, Z.A[][] = y; Z.R = ; Z.C = ;
    Y.A[][] = , Y.A[][] = , Y.A[][] = , Y.A[][] = ; Y.R = ; Y.C = ;
    X.A[][] = , X.A[][] = , X.A[][] = , X.A[][] = ; X.R = ; X.C = ;
}
 
void work()
{
    while (n)
    {
        if (n %  == ) Y = Y*X;
        n = n >> ;
        X = X*X;
    }
    Z = Z*Y;
 
    printf("%lld\n", mod(Z.A[][], MOD));
}
 
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        read();
        init();
        work();
    }
    return ;
}