BAEKJOON 2684 - Penney Game

문제: https://www.acmicpc.net/problem/2684

문제

Penney’s game is a simple game typically played by two players. One version of the game calls for each player to choose a unique three-coin sequence such as HEADS TAILS HEADS (HTH). A fair coin is tossed sequentially some number of times until one of the two sequences appears. The player who chose the first sequence to appear wins the game.

For this problem, you will write a program that implements a variation on the Penney Game. You will read a sequence of 40 coin tosses and determine how many times each three-coin sequence appears. Obviously there are eight such three-coin sequences: TTT, TTH, THT, THH, HTT, HTH, HHT and HHH. Sequences may overlap. For example, if all 40 coin tosses are heads, then the sequence HHH appears 38 times.

입력

The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set consists of 2 lines. The first line contains the data set number N. The second line contains the sequence of 40 coin tosses. Each toss is represented as an upper case H or an upper case T, for heads or tails, respectively. There will be no spaces on any input line.

출력

For each data set there is one line of output. It contains the data set number followed by a single space, followed by the number of occurrences of each three-coin sequence, in the order shown above, with a space between each one. There should be a total of 9 space separated decimal integers on each output line.

예제 입력 

4
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
HHTTTHHTTTHTHHTHHTTHTTTHHHTHTTHTTHTTTHTH
HTHTHHHTHHHTHTHHHHTTTHTTTTTHHTTTTHTHHHHT

예제 출력 

0 0 0 0 0 0 0 38
38 0 0 0 0 0 0 0
4 7 6 4 7 4 5 1
6 3 4 5 3 6 5 6

힌트

출처

ACM-ICPC > Regionals > North America > Greater New York Region > 2010 Greater New York Programming Contest A번

• 문제를 번역한 사람: baekjoon Nada

링크

• ACM-ICPC Live Archive
• Sphere Online Judge

문자열 자르기로 쉽게 풀 수 있는 문제입니다.

#include <fstream>
#include <iostream>
#include <cstring>
#include <climits>
#include <algorithm>
 
#include <string>
using namespace std;
 
string arrStr[8] = { "TTT", "TTH", "THT", "THH", "HTT", "HTH", "HHT", "HHH" };
 
 
int main()
{
    int cases;
    cin >> cases;
    for (int i = 0; i < cases; i++)
    {
        int ret[8] = { 0, };
        string str;
        cin >> str;
        for (int s = 0; s < 38; s++)
        {
            string sub = str.substr(s, 3);
            for (int j = 0; j < 8; j++)
            {
                if (sub == arrStr[j])
                {
                    ret[j]++;
                    break;
                }
            }
        }
        for (int k = 0; k < 8; k++)
        {
            cout << ret[k];
            if (k != 7)
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}