#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <cmath>#include <algorithm>using namespace std;const double eps = 1e-6;const double pi = acos(-1.0);const int INF = 0x3f3f3f3f;const int MOD = 1000000007;#define ll long long#define CL(a) memset(a,0,sizeof(a))char s[1000010];int main (){int T;cin>>T;for (int cas=1; cas<=T; cas++){cin>>s;cout<<"Case #"<<cas<<": ";int k=0;bool flag = false;if (s[0]==' '){cout<<"0"<<endl;continue;}for (int i=0; s[i]; i++,k++)//找到第一个c{if (s[i]!='c'&&s[i]!='f') {flag=true; break;}if (s[i]=='c') {break;}}//cout<<k<<endl;if (s[k]=='\0')//若全为f，输出最小个数{cout<<k/2+k%2<<endl;continue;}int cnt=0,ans=1;for(int i=k+1; s[i]; i++)//从第一个c后面开始找{if (s[i]!='c'&&s[i]!='f') {flag = true; break;}if (s[i]!='c') cnt++;else{if (cnt>=2){cnt=0; ans++;}//如果c后面的f个数大于2个，，加1else {flag=true; break;}}}if (k+cnt<2) flag=true;//特判，如果第一个c后面的f不足2个if (flag) cout<<"-1"<<endl;else cout<<ans<<endl;}return 0;}
幸福就是重复。每天跟自己喜欢的人一起，通电话，
