hdu4639 hehe ——斐波纳契数列，找规律

link:http://acm.hdu.edu.cn/showproblem.php?pid=4639

refer to:

http://blog.csdn.net/dongdongzhang_/article/details/9706259

http://www.cnblogs.com/wuhenqs/archive/2013/08/01/3230987.html

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <cmath>
 #include <cctype>
 #include <algorithm>
 #include <queue>
 #include <deque>
 #include <queue>
 #include <list>
 #include <map>
 #include <set>
 #include <vector>
 #include <utility>
 #include <functional>
 #include <fstream>
 #include <iomanip>
 #include <sstream>
 #include <numeric>
 #include <cassert>
 #include <ctime>
 #include <iterator>
 const int INF = 0x3f3f3f3f;
 const int dir[][] = {{-,},{,},{,-},{,},{-,-},{-,},{,-},{,}};
 using namespace std;
 
 const int MOD = ;
 char a[];
 long long fi[];
 int main(void)
 {
     #ifndef ONLINE_JUDGE
     freopen("in.txt", "r", stdin);
     #endif
     ios::sync_with_stdio(false);
     int t; cin>>t;
     fi[] = fi[] = ;
     for (int i = ; i < ; ++i) fi[i] = (fi[i-]+fi[i-])%MOD;
     for (int i = ; i <= t; ++i)
     {
         cin>>a; int len = strlen(a), cnt = , ans = ;
         for (int j = ; j < len; ++j)
         {
             if (a[j]=='e' && a[j-]=='h')
             {
                 ++j; cnt++;
             }
             else
             {
                 ans = (ans*fi[cnt])%MOD; cnt = ;
             }
         }
         ans = (ans*fi[cnt])%MOD;
         cout<<"Case "<<i<<": "<<ans<<endl;
     }
 
 }

o(╯□╰)o