第八场积分赛—E - Interview with Oleg

Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters.

There is a filler word ogo in Oleg’s speech. All words that can be obtained from ogo by adding go several times to the end of it are also considered to be fillers. For example, the words ogo, ogogo, ogogogo are fillers, but the words go, og, ogog, ogogog and oggo are not fillers.

The fillers have maximal size, for example, for ogogoo speech we can’t consider ogo a filler and goo as a normal phrase. We should consider ogogo as a filler here.

To print the interview, Polycarp has to replace each of the fillers with three asterisks. Note that a filler word is replaced with exactly three asterisks regardless of its length.

Polycarp has dealt with this problem in no time. Can you do the same? The clock is ticking!

Input
The first line contains a positive integer n (1 ≤ n ≤ 100) — the length of the interview.

The second line contains the string s of length n, consisting of lowercase English letters.

Output
Print the interview text after the replacement of each of the fillers with ““. It is allowed for the substring “” to have several consecutive occurences.

Examples
Input
7
aogogob
Output
a***b
Input
13
ogogmgogogogo
Output
gmg
Input
9
ogoogoogo
Output

---

Note
The first sample contains one filler word ogogo, so the interview for printing is “a***b”.

The second sample contains two fillers ogo and ogogogo. Thus, the interview is transformed to “gmg“.

题意：总结来说就是把ogo用***代替，如果后面接有go直接忽略。其他的原样输出。

思路：比赛时没有想到go是直接忽略的。还在一直数ogogog串的长度。思路完全跑偏。伤心。其实可以拆开来考虑，满足ogo的代替之后直接向后移三位。遇到go的直接跳过，但要记得向后移两位。其他的字符，每次输出后移动一位。

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
char s[110];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",s);
        for(int i=0; i<n; )
        {
            if(s[i]=='o'&&s[i+1]=='g'&&s[i+2]=='o')//出现ogo用***代替，因为长度为3，所以i+=3
            {
                i+=3;
                while (s[i]=='g'&&s[i+1]=='o')//出现go的直接放弃因为长度为2，所以i+=2
                {
                    i+=2;
                    continue;
                }
                printf("***");
            }
            else//不满足上述情况的字符原样输出，单个字符，所以i++
            {
                printf("%c",s[i]);
                i++;
            }
        }
        printf("\n");
    }
    return 0;
}