【HDOJ】5564 Clarke and digits

DP+快速矩阵幂。注意base矩阵的初始化，不难。

 /* 5564 */
 #include <iostream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 #define lson            l, mid, rt<<1
 #define rson            mid+1, r, rt<<1|1

 const int mod = 1e9+;
 const int maxn = ;
 int ID[maxn][maxn];
 int n;

 typedef struct mat_t {
     __int64 m[maxn][maxn];

     mat_t() {
         memset(m, , sizeof(m));
     }

     void init() {
         memset(m, , sizeof(m));
     }

     void print() {
         rep(i, , n) {
             rep(j, , n) {
                 printf("%I64d ", m[i][j]);
             }
             putchar('\n');
         }
     }
 } mat_t;

 mat_t matMult(mat_t& a, mat_t& b) {
     mat_t c;

     rep(i, , n)
         rep(j, , n)
             rep(k, , n)
                 c.m[i][j] = (c.m[i][j] + a.m[i][k]*b.m[k][j]%mod)%mod;

     return c;
 }

 mat_t matPow(mat_t a, int m) {
     mat_t ret;

     rep(i, , n)
         ret.m[i][i] = ;
     while (m) {
         if (m & )
             ret = matMult(ret, a);
         a = matMult(a, a);
         m >>= ;
     }

     return ret;
 }

 mat_t e;
 mat_t base;

 void init(int s) {
     // first column is one
     // first row is zero(accept first one)
     rep(j, , n) {
         e.m[][j] = ;
         if (j% == )
             e.m[j][] = ;
         else
             e.m[j][] = ;
     }
     e.m[][] = ;

     rep(i, , ) {
         rep(j, , ) {
             rep(ii, , ) {
                 int jj = (*j+ii)%;
                 int id = ID[i][j];
                 int id_ = ID[ii][jj];
                 if (i+ii == s)
                     e.m[id][id_] = ;
                 else
                     e.m[id][id_] = ;
             }
         }
     }

     #ifndef ONLINE_JUDGE
         // e.print();
     #endif
 }

 void init_base() {
     int cnt = ;
     n = *+;

     rep(i, , )
         rep(j, , )
             ID[i][j] = cnt++;
     rep(i, , )
         base.m[][ID[i][i%]] = ;
 }

 __int64 cal(int len) {
     if (len == )
         return ;

     __int64 ret = ;
     mat_t res = matPow(e, len);

     rep(i, , n)
         ret = (ret + base.m[][i]*res.m[i][]%mod)%mod;
     return ret;
 }

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     int t;
     int l, r, s;
     __int64 nl, nr, ans;

     init_base();
     scanf("%d", &t);
     while (t--) {
         scanf("%d %d %d", &l, &r, &s);
         init(s);
         nl = cal(l-);
         nr = cal(r);
         ans = (nr-nl+mod) % mod;
         #ifndef ONLINE_JUDGE
             printf("nl = %I64d, nr = %I64d\n", nl, nr);
         #endif
         printf("%I64d\n", ans);
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }