标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1411 Accepted Submission(s): 502
#include<iostream> #include<stdio.h> #include<string.h> #include<math.h> #include <algorithm> #include <map> #include <vector> using namespace std; typedef long long LL; char str[2005],res[2005]; int n; bool flag; bool judge(char *str){ int len = strlen(str); for(int i=0,j=len-1;i<=j;i++,j--){ if(str[i]!=str[j]) return true; } return false; } void dfs(int step){ if(flag) return; if(step==n) { if(judge(str)){ flag = true; strcpy(res,str); } return; } if(str[step]==‘?‘){ for(int i=‘a‘;i<=‘z‘;i++){ str[step]=i; dfs(step+1); str[step]=‘?‘; } }else{ dfs(step+1); } return; } int main(){ while(scanf("%d",&n)!=EOF){ flag= false; scanf("%s",str); dfs(0); if(flag) printf("%s\n",res); else printf("QwQ\n"); } }
标签:
原文地址:http://www.cnblogs.com/liyinggang/p/5766218.html