HDU 4291 A Short problem

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 typedef long long LL;
 4 const int maxn = 3;
 5 LL mod = 1000000007;
 6 const int n = 2;
 7 struct Matrix {
 8     LL m[maxn][maxn];
 9     void init() {
10         memset(m,0,sizeof m);
11     }
12     Matrix() {
13         init();
14     }
15     Matrix operator*(const Matrix &rhs) const {
16         Matrix ret;
17         for(int k = 0; k < n; ++k) {
18             for(int i = 0; i < n; ++i)
19                 for(int j = 0; j < n; ++j)
20                     ret.m[i][j] = (ret.m[i][j] + m[i][k]*rhs.m[k][j]%mod)%mod;
21 
22         }
23         return ret;
24     }
25     void set_a() {
26         init();
27         m[0][0] = 0;
28         m[0][1] = 1;
29     }
30     void set_b() {
31         init();
32         m[0][0] = 0;
33         m[0][1] = m[1][0] = 1;
34         m[1][1] = 3;
35     }
36     void print() {
37         for(int i = 0; i < n; ++i) {
38             for(int j = 0; j < n; ++j)
39                 cout<<m[i][j]<<" ";
40             cout<<endl;
41         }
42     }
43 };
44 Matrix a,b;
45 LL quickPow(LL index,LL md) {
46     a.set_a();
47     b.set_b();
48     mod = md;
49     while(index) {
50         if(index&1) {
51             a = a*b;
52         }
53         index >>= 1;
54         b = b*b;
55     }
56     return a.m[0][0];
57 }
58 int main() {
59     LL m;
60     while(~scanf("%I64d",&m))
61         printf("%I64d\n",quickPow(quickPow(quickPow(m,183120),222222224),1000000007));
62     return 0;
63 }