Codeforces #380（Div.2）A.Interview with Oleg【模拟】水题

最新推荐文章于 2022-11-22 23:15:14 发布

原创最新推荐文章于 2022-11-22 23:15:14 发布 · 732 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Codeforces #380Div.2

水题同时被 2 个专栏收录

175 篇文章

订阅专栏

模拟

75 篇文章

订阅专栏

本文介绍了一个有趣的字符串处理问题，即如何将一段没有标点符号和空格的采访记录中的特定填充词替换为统一的标记。通过遍历字符串并识别特定模式，实现了对原始文本的有效转换。

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***".

题目大意：

给你一个长度为N的字符串。

每次要求将包含ogo+go（不限个数）的部分变成：***

求这个缩短后的字符串。

思路：

暴力处理即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
char a[5000];
char ans[5000];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",a);
        int cont=0;
        for(int i=0;i<n;i++)
        {
            if(a[i]=='o'&&a[i+1]=='g'&&a[i+2]=='o')
            {
                int j;
                int d=1;
                for(j=i+3;j<n;j++)
                {
                    if(a[j]=='g'&&d==1&&a[j+1]=='o')
                    {
                        d=1-d;
                        continue;
                    }
                    if(a[j]=='o'&&d==0)
                    {
                        if(a[j+1]=='g')
                        {
                            d=1-d;
                            continue;
                        }
                        else
                        {
                            j++;
                            break;
                        }
                    }
                    break;
                }
                i=j-1;
                for(int j=0;j<3;j++)
                ans[cont++]='*';
            }
            else
            {
                ans[cont++]=a[i];
            }
        }
        for(int i=0;i<cont;i++)
        {
            printf("%c",ans[i]);
        }
        printf("\n");
    }
}