hdu4639Hehe

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

统计连续he的数量恰为斐波序列  不同块进行相乘

#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<stdlib.h>
#define mod 10007
using namespace std;
char ss[11000];
int f[11000];
int main()
{
    int t,i,k,kk=0;
    cin>>t;
    f[1] = 1;f[2] = 2;
    for(i = 3; i <= 10086 ; i++)
    f[i] = (f[i-1]%mod+f[i-2]%mod)%mod;
    while(t--)
    {
        cin>>ss;kk++;
        k = strlen(ss);
        int g = 0,s=1;
        for(i = 0 ; i < k ;i++)
        {
            if((i+1)<k&&ss[i]=='h'&&ss[i+1]=='e')
            {
                g++;
                i++;
                continue;
            }
            else if(g!=0)
            {
                s=(s*f[g])%mod;
                g=0;
            }
        }
        if(g)
        s = (s*f[g])%mod;
        printf("Case %d: ",kk);
        cout<<s<<endl;
    }
    return 0;
}