2016CCPC 中南地区邀请赛 A 矩阵快速幂

A

A^n=A^(n%2016)%7;

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <sstream>
 #include <string>
 #include <algorithm>
 #include <list>
 #include <map>
 #include <vector>
 #include <queue>
 #include <stack>
 #include <cmath>
 #include <cstdlib>
 // #include <conio.h>
 using namespace std;
 #define clc(a,b) memset(a,b,sizeof(a))
 #define inf 0x3f3f3f3f
 const int N=;
 const int MOD = 1e9+;
 #define LL long long
 double const pi = acos(-);
 // void fre() {
 //     freopen("in.txt","r",stdin);
 // }
 // inline int r() {
 //     int x=0,f=1;char ch=getchar();
 //     while(ch>'9'||ch<'0') {if(ch=='-') f=-1;ch=getchar();}
 //     while(ch>='0'&&ch<='9') { x=x*10+ch-'0';ch=getchar();}return x*f;
 // }

 int mod(string s){
   int len;
   int i;
   int ans=;
   len=s.length();
   // cout<<s<<endl;
   for(i=;i<len;i++)
   ans=(ans*+s[i]-'')%;
   return ans;
 }

 struct matrix
 {
     int m[][];
 }ans, base;

 matrix multi(matrix a, matrix b)
 {
     matrix tmp;
     for(int i = ; i < ; ++i)
     {
         for(int j = ; j < ; ++j)
         {
             tmp.m[i][j] = ;
             for(int k = ; k < ; ++k)
                 tmp.m[i][j] = (tmp.m[i][j] + a.m[i][k] * b.m[k][j]) % ;
         }
     }
     return tmp;
 }

 void fast_mod(int n)
 {
     int a,b,c,d;
     scanf("%d%d%d%d",&a,&b,&c,&d);
     base.m[][] =a;
     base.m[][] =b;
     base.m[][] =c;
     base.m[][] =d;
     ans.m[][] = ans.m[][] = ;
     ans.m[][] = ans.m[][] = ;
     if(n==){
         printf("1 0\n");
         printf("0 1\n");
         return;
     }
     while(n)
     {
         if(n & )
         {
             ans = multi(ans, base);
         }
         base = multi(base, base);
         n >>= ;
     }
     printf("%d %d\n",ans.m[][],ans.m[][]);
     printf("%d %d\n",ans.m[][],ans.m[][]);
     return;
 }

 int main(){
     // fre();
     string s;
     while(cin>>s){
          int n;
          n=mod(s);
          // cout<<n<<endl;
          fast_mod(n);
     }
     return ;
 }