HDU 4639

简单题，连续n个he，考虑最后一个he，分为单独一个和与前面一个he结合，所以table[n] = table[n-1]+table[n-2];

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;
#define mod 10007

int table[10005];

int main()
{
    int i , t , tcase = 1;
    char str[20005];
    for (table[0] = table[1] = 1 , i = 2 ; i <= 10000 ; i++)table[i] = (table[i-1]+table[i-2])%mod;
    scanf("%d",&t);
    while (t--)
    {
          scanf("%s",str);
          int len = strlen(str);
          int ans = 1;
          i = 0;
          while (i < len)
          {
                int num = 0;
                while (str[i] == 'h' && str[i+1] == 'e')
                {
                    i += 2;
                    num++;
                }
                ans = ans*table[num]%mod;
                i++;
          }
          printf("Case %d: %d\n",tcase++,ans);
    }
    return 0;
}