2368. Penney Game
2011-05-20 08:56 Min·zc 阅读(214) 评论(0) 编辑 收藏 举报
1 /*
2 *
3 *直接遍历一遍字符串,统计就可以
4 *
5 */
6
7 #include <iostream>
8 #include <string.h>
9 using namespace std;
10 int main()
11 {
12 int t;
13 cin>>t;
14 while(t--)
15 {
16 char w[100];
17 int ans[8];
18 for(int i=0;i<8;i++)
19 ans[i]=0;
20 int n;
21 cin>>n;
22 cin>>w;
23 int len=strlen(w);
24 char tem[4];
25 for(int i=0;i<len-2;i++)
26 {
27 for(int j=0;j<3;j++)
28 {
29 tem[j]=w[i+j];
30
31 }
32 tem[3]='\0';
33 // cout<<tem<<endl;
34 if(strcmp(tem,"TTT")==0)
35 ans[0]++;
36 if(strcmp(tem,"TTH")==0)
37 ans[1]++;
38 if(strcmp(tem,"THT")==0)
39 ans[2]++;
40 if(strcmp(tem,"THH")==0)
41 ans[3]++;
42 if(strcmp(tem,"HTT")==0)
43 ans[4]++;
44 if(strcmp(tem,"HTH")==0)
45 ans[5]++;
46 if(strcmp(tem,"HHT")==0)
47 ans[6]++;
48 if(strcmp(tem,"HHH")==0)
49 ans[7]++;
50 }
51 cout<<n;
52 for(int i=0;i<8;i++)
53 cout<<" "<<ans[i];
54 cout<<endl;
55 }
56 }
2 *
3 *直接遍历一遍字符串,统计就可以
4 *
5 */
6
7 #include <iostream>
8 #include <string.h>
9 using namespace std;
10 int main()
11 {
12 int t;
13 cin>>t;
14 while(t--)
15 {
16 char w[100];
17 int ans[8];
18 for(int i=0;i<8;i++)
19 ans[i]=0;
20 int n;
21 cin>>n;
22 cin>>w;
23 int len=strlen(w);
24 char tem[4];
25 for(int i=0;i<len-2;i++)
26 {
27 for(int j=0;j<3;j++)
28 {
29 tem[j]=w[i+j];
30
31 }
32 tem[3]='\0';
33 // cout<<tem<<endl;
34 if(strcmp(tem,"TTT")==0)
35 ans[0]++;
36 if(strcmp(tem,"TTH")==0)
37 ans[1]++;
38 if(strcmp(tem,"THT")==0)
39 ans[2]++;
40 if(strcmp(tem,"THH")==0)
41 ans[3]++;
42 if(strcmp(tem,"HTT")==0)
43 ans[4]++;
44 if(strcmp(tem,"HTH")==0)
45 ans[5]++;
46 if(strcmp(tem,"HHT")==0)
47 ans[6]++;
48 if(strcmp(tem,"HHH")==0)
49 ans[7]++;
50 }
51 cout<<n;
52 for(int i=0;i<8;i++)
53 cout<<" "<<ans[i];
54 cout<<endl;
55 }
56 }