标签:
链接:
http://acm.hdu.edu.cn/showproblem.php?pid=5455
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 233 Accepted Submission(s): 110
代码:
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; #define N 1100000 char s[N]; int main() { int t, iCase=1; scanf("%d", &t); while(t--) { int i, num=0, sum=0, flag=0, len; scanf("%s", s); len = strlen(s)-1; for(i=0; i<=len; i++) { if(s[i]==‘f‘) num++; if(s[i]!=‘f‘ && s[i]!=‘c‘) flag = 1; if(s[i]==‘c‘) { if(i==len-1 && s[0]==‘f‘ && s[len]==‘f‘) sum ++; else if(i==len && s[0]==‘f‘ && s[1]==‘f‘) sum ++; else if(s[i+1]==‘f‘ && s[i+2]==‘f‘) sum++; else flag = 1; } } printf("Case #%d: ", iCase++); if(flag) printf("-1\n"); else { if(sum) printf("%d\n", sum); else if(len+1==num) printf("%d\n", (num+1)/2); else printf("-1\n"); } } return 0; }
(字符串处理)Fang Fang -- hdu -- 5455 (2015 ACM/ICPC Asia Regional Shenyang Online)
标签:
原文地址:http://www.cnblogs.com/YY56/p/4822169.html