HDU - 5455 Fang Fang

Sample Input
8
ffcfffcffcff
cffcfff
cffcff
cffcf
ffffcffcfff
cffcfffcffffcfffff
cff
cffc
 

Sample Output
Case #1: 3
Case #2: 2
Case #3: 2
Case #4: -1
Case #5: 2
Case #6: 4
Case #7: 1
Case #8: -1
Hint

Shift the string in the first test case, we will get the string "cffffcfffcff"
and it can be split into "cffff", "cfff" and "cff".

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<string.h>
 5 #include<math.h>
 6 #include<queue>
 7 #include<stdlib.h>
 8 
 9 using namespace std;
10 #define N  1010000
11 #define INF 0x3f3f3f3f
12 
13 char s[N];
14 
15 int main()
16 {
17     int k=1,T,i;
18 
19     scanf("%d",&T);
20 
21     while(T--)
22     {
23         scanf("%s", s);
24 
25         int f=0,ans=0;
26         int len=strlen(s);
27 
28         s[len]=s[0];///ffcffc结果是3
29         s[len+1]=s[1];
30 
31         for(i=0; i<len; i++)///输入有可能存在其他的字符
32         {
33             if(s[i]==‘c‘||s[i]==‘f‘)
34                 continue ;
35             else
36             {
37                 f=1;
38                 break;
39             }
40         }
41 
42         for(i=0;i<len;i++)
43         {
44             if(f==0)
45             {
46                 if(s[i]==‘c‘)
47                 {
48                     if(s[i+1]==‘f‘&&s[i+2]==‘f‘)
49                     {
50                         i++;
51                         while(i<len&&s[i]==‘f‘)///遇见c跳出
52                             i++;
53                         ans++;///个数加一
54                         i--;
55                     }
56                     else
57                         f=1;
58                 }
59             }
60         }
61 
62         printf("Case #%d: ",k++);
63         if(f==1)
64             printf("-1\n");
65         else if(ans==0)///全是f
66             printf("%d\n", len/2+len%2);
67         else
68             printf("%d\n", ans);
69     }
70     return 0;
71 }