Spring-1-I 233 Matrix（HDU 5015）解题报告及测试数据

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

#include <iostream>

#include <cstdio>

#include <string>

#include <cstring>

#include <algorithm>

#include <cctype>

#include <sstream>

#include <queue>

#include <stack>

#include <stack>

#include <map>

using namespace std;

#define F(i,s,e) for(int i = s;i<e;i++)

#define FA(i,s,e) for(int i=s;i>e;i--)

#define ss(x) scanf("%d",&x)

#define s64(x) scanf("%I64d",&x)

#define write() freopen("1.in","r",stdin)

#define W(x) while(x)

typedef long long LL;

int aa[15];

int N;

const int Mod = 10000007;

struct Matrix{

    LL m[15][15];

    Matrix(){

        memset(m,0,sizeof(m));

    }

};

void init(Matrix&a,int n){//构造初始矩阵

    N = n+2;

    F(i,0,N)F(j,0,N)a.m[i][j]=0;

    F(i,0,n)FA(j,n-1,i-1)a.m[i][j]=1;

    F(i,0,n)a.m[n][i]=1;

    a.m[n][n]=10;

    a.m[n+1][n]=3;

    a.m[n+1][n+1]=1;

}

Matrix mul(Matrix a,Matrix b){//矩阵乘法

    Matrix c;

    F(i,0,N)

    F(j,0,N)

    F(k,0,N)

    c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j]) % Mod;

    return c;

}

Matrix power_m(Matrix a,int m){//矩阵快速幂

    Matrix b;

    F(i,0,N)b.m[i][i]=1;

    W(m){

        if(m%2)b = mul(a,b);//如果是奇数，则先乘出

        a = mul(a,a);

        m = m/2;

    }

    return b;

}

int main(){

    //write();

    int n,m;

    LL ans;

    Matrix a,b;

    W(ss(n)!=EOF){

        ss(m);

        F(i,0,n)ss(aa[i]);

        aa[n]=233;aa[n+1]=1;

        ans =0;

        init(a,n);

        b = power_m(a,m);  

        F(i,0,N)ans=(ans+aa[i]*b.m[i][n-1])%Mod;//计算右下角的值

        printf("%I64d\n",ans);

    }  

}