Cod sursa(job #1233627)

Utilizator apopeid15Apopei Daniel apopeid15 Data 25 septembrie 2014 19:54:17
Problema Pod Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.52 kb
#include <algorithm>
#include <fstream>
#include <cstring>
 
using namespace std;
 
const int Mmax=1005, Kmax=20, MOD=9901;
 
ifstream fin("pod.in");
ofstream fout("pod.out");
 
int N, M, K;
int A[Mmax];
 
class Matrix {
public:
    Matrix() {memset(Mat, 0, sizeof(Mat));}
 
    void operator *=(Matrix A)
    {
        int C[Kmax][Kmax];
        memset(C, 0, sizeof(C));
 
        for(int i=0;i<K;i++)
        {
            for(int j=0;j<K;j++)
            {
                for(int k=0;k<K;k++)
                {
                    C[i][j]=C[i][j]+Mat[i][k]*A[k][j];
                }
            }
        }
 
        for(int i=0;i<K;i++)
        {
            for(int j=0;j<K;j++)
            {
                Mat[i][j]=C[i][j]%MOD;
            }
        }
    }
 
    int* operator[](int i) {return Mat[i];}
private:
    int Mat[Kmax][Kmax];
};
 
Matrix MatInit;
 
void Init()
{
    for(int i=1;i<K;i++) MatInit[i][i-1]=1;
    MatInit[0][K-1]=MatInit[K-1][K-1]=1;
}
 
Matrix pw(Matrix A, int y)
{
    Matrix ret=A;
    A=MatInit;
 
    for(;y;y>>=1)
    {
        if(y&1) ret*=A;
        A*=A;
    }
 
    return ret;
}
 
int main()
{
    fin>>N>>M>>K;
 
    for(int i=1;i<=M;i++) fin>>A[i];
    A[++M]=N;
    sort(A+1, A+M+1);
 
    Init();
 
    Matrix Sol;
    Sol[0][K-1]=1;
 
    for(int i=1;i<=M;i++)
    {
        Sol=pw(Sol, A[i]-A[i-1]);
        if(i<M) Sol[0][K-1]=0;
    }
 
    fout<<Sol[0][K-1]<<"\n";
 
    fin.close();
    fout.close();
}