zoukankan      html  css  js  c++  java
  • CodeForces 738A Interview with Oleg

    模拟。

    #pragma comment(linker, "/STACK:1024000000,1024000000")
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    #include<vector>
    #include<map>
    #include<set>
    #include<queue>
    #include<stack>
    #include<ctime>
    #include<iostream>
    using namespace std;
    typedef long long LL;
    const double pi=acos(-1.0);
    void File()
    {
        freopen("D:\in.txt","r",stdin);
        freopen("D:\out.txt","w",stdout);
    }//.
    template <class T>
    inline void read(T &x)
    {
        char c = getchar();
        x = 0;
        while(!isdigit(c)) c = getchar();
        while(isdigit(c))
        {
            x = x * 10 + c - '0';
            c = getchar();
        }
    }
    
    int n;
    char s[110];
    
    int main()
    {
        cin>>n;
        cin>>s;
        int len=strlen(s);
        for(int i=0;i<len;)
        {
            if(s[i]=='o')
            {
                int j;
                for(j=i+1;j<len;)
                {
                    if(j<len&&j+1<len&&s[j]=='g'&&s[j+1]=='o') j=j+2;
                    else break;
                }
    
                if(i+1==j)
                {
                    printf("%c",s[i]);
                    i=j;
                }
                else
                {
                    printf("***");
                    i=j;
                }
    
            }
            else
            {
                printf("%c",s[i]);
                i++;
            }
        }
        return 0;
    }
  • 相关阅读:
    Scala学习笔记
    flume ng 1.3 安装(转)
    学习scala trait
    scala性能测试
    scala容器使用
    hdu 4607 Park Visit
    FZU 1591 Coral的烦恼
    fzu 1675 The Seventy-seven Problem
    hdu 4602 Partition
    zoj 1842 Prime Distance
  • 原文地址:https://www.cnblogs.com/zufezzt/p/6397091.html
Copyright © 2011-2022 走看看