标签:
Rikka with string
Accepts: 395
Submissions: 2281QwQ
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<cstdlib>
#include<set>
#include<stack>
#include<cstring>
using namespace std;
template<class T>inline T read(T&x)
{
char c;
while((c=getchar())<=32)if(c==EOF)return 0;
bool ok=false;
if(c=='-')ok=true,c=getchar();
for(x=0; c>32; c=getchar())
x=x*10+c-'0';
if(ok)x=-x;
return 1;
}
template<class T> inline T read_(T&x,T&y)
{
return read(x)&&read(y);
}
template<class T> inline T read__(T&x,T&y,T&z)
{
return read(x)&&read(y)&&read(z);
}
template<class T> inline void write(T x)
{
if(x<0)putchar('-'),x=-x;
if(x<10)putchar(x+'0');
else write(x/10),putchar(x%10+'0');
}
template<class T>inline void writeln(T x)
{
write(x);
putchar('\n');
}
//-------ZCC IO template------
const int maxn=100001;
const double inf=999999999;
#define lson (rt<<1),L,M
#define rson (rt<<1|1),M+1,R
#define M ((L+R)>>1)
#define For(i,t,n) for(int i=(t);i<(n);i++)
typedef long long LL;
typedef double DB;
typedef pair<int,int> P;
#define bug printf("---\n");
#define mod 10007
int n;
char a[maxn];
bool pan(char *s)
{
for(int i=0; i<=n/2; i++)
{
if(a[i]!=a[n-1-i])return true;
}
return false;
}
int b[maxn];
int main()
{
// #ifndef ONLINE_JUDGE
// freopen("in.txt","r",stdin);
// #endif // ONLINE_JUDGE
int m,i,j,k,t;
while(read(n))
{
scanf("%s",a);
memset(b,0,sizeof(b));
bool flag=false;
for(i=0,j=0; i<n; i++)if(a[i]=='?')
{
flag=true;
b[j++]=i;
}
if((!flag&&!pan(a))||(!pan(a)&&n%2==1&&a[n/2]=='?'&&j==1))
{
puts("QwQ");
}
else
{
bool ok=false;
for(i=0;i<n;i++)if(a[i]=='?')a[i]='a';
for(i=j-1; i>=0; i--)
{
for(char k='a'; k<='z'; k++)
{
a[b[i]]=k;
if(pan(a))
{
ok=true;
break;
}
}
if(ok)
break;
else
a[b[i]]='a';
}
puts(a);
}
}
return 0;
}
标签:
原文地址:http://blog.csdn.net/u013167299/article/details/44999259