CodeForces 711A Bus to Udayland

简单题。

#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<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-;

int n;
char s[][];

int main()
{
    scanf("%d",&n);
    for(int i=;i<=n;i++) scanf("%s",s[i]);
    bool f=;
    for(int i=;i<=n;i++)
    {
        if(f==) break;
        if(s[i][]=='O'&&s[i][]=='O')
        {
            s[i][]='+';
            s[i][]='+';
            f=;
        }
        if(f==) break;

         if(s[i][]=='O'&&s[i][]=='O')
        {
            s[i][]='+';
            s[i][]='+';
            f=;
        }
         if(f==) break;
    }

    if(f==) printf("NO\n");
    else
    {
        printf("YES\n");
        for(int i=;i<=n;i++) printf("%s\n",s[i]);
    }

    return ;
}