time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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“.
【题目链接】:http://codeforces.com/contest/738/problem/A
【题解】
找到第一个ogo的位置，然后往后找”go”；把ogo替换成三个*;后面的go替换成一个标识符&,最后不输出就好;
(或者你找到一个就直接输出三个*,其他的按照原序列输出也可以）
简单的字符串处理;
【完整代码】
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
int main()
{
//freopen("F:\rush.txt","r",stdin);
cin >> n;
cin >> s;
int len = s.size();
for (int i = 0;i <= len-1;i++)
if (i+2<=len-1 && s[i]=='o' && s[i+1]=='g' && s[i+2]=='o')
{
int j = i+3;
while (j+1<=len-1 && s[j]=='g' && s[j+1]=='o')
{
j+=2;
}
for (int k = i;k <= i+2;k++)
s[k] = '*';
for (int k = i+3;k <= j-1;k++)
s[k] = '$';
i = j-1;
}
for (int i = 0;i <= len-1;i++)
if (s[i]!='$')
putchar(s[i]);
return 0;
}