原题目链接:HDU1015
分类:
HDU 暴力 回溯 DFS
题意:
给temp赋一个值,然后给出一个字符串(不会出现相同字母,即字符串最长26),从中选出5个字母最为v,w,x,y,z(A=1, B=2, …, Z=26)使之满足等式v - w^2 + x^3 - y^4 + z^5 = target ,并输出由这5个字母组成字典序最大的字符串,不存在输出no solution
样例输入输出:
Sample Input:
1 ABCDEFGHIJKL
11700519 ZAYEXIWOVU
3072997 SOUGHT
1234567 THEQUICKFROG
0 END
Sample Output:
LKEBA
YOXUZ
GHOST
no solution
想法:
- dfs深搜
- 最大数据:26 * 25 * 24 * 23,可以直接暴力5层循环
代码:
DFS深搜:(31ms)
//31ms
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1111;
char str[maxn],ch[maxn],max_ch[maxn];
int vis[11111];
int flag,temp,len;
int cal(char a,char b,char c,char d,char e){
int z,x,v,n,m;
z=a-'A'+1;
x=(b-'A'+1)*(b-'A'+1);
v=(c-'A'+1)*(c-'A'+1)*(c-'A'+1);
n=(d-'A'+1)*(d-'A'+1)*(d-'A'+1)*(d-'A'+1);
m=(e-'A'+1)*(e-'A'+1)*(e-'A'+1)*(e-'A'+1)*(e-'A'+1);
if((z-x+v-n+m)==temp) return 1;
return 0;
}
void dfs(int n){
if(n==5){
if(cal(ch[0],ch[1],ch[2],ch[3],ch[4])&&strcmp(ch,max_ch)>0){
strcpy(max_ch,ch);
}
}else{
for(int i=0;i<len;i++){
//int m = str[i] - 'A' + 1;
if(vis[str[i]]==0){
ch[n] = str[i];
vis[str[i]] = 1;//标记用过
dfs(n+1);
vis[str[i]] = 0;
}
}
}
}
int main() {
freopen("in.txt","r",stdin);
while(scanf("%d%s",&temp,str)!=EOF&&(temp||strcmp(str,"END"))){
memset(ch,'\0',sizeof(ch));
memset(max_ch,'\0',sizeof(max_ch));
memset(vis,0,sizeof(vis));
len = strlen(str);
sort(str,str+len);
dfs(0);
if(strlen(max_ch)!=0) printf("%s\n",max_ch);
else printf("no solution\n");
}
return 0;
}
暴力5循环:(46ms)
//46ms
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1111;
char str[maxn],ch[maxn],max_ch[maxn];
int flag,temp;
int cal(char a,char b,char c,char d,char e){
int z,x,v,n,m;
z=a-'A'+1;
x=(b-'A'+1)*(b-'A'+1);
v=(c-'A'+1)*(c-'A'+1)*(c-'A'+1);
n=(d-'A'+1)*(d-'A'+1)*(d-'A'+1)*(d-'A'+1);
m=(e-'A'+1)*(e-'A'+1)*(e-'A'+1)*(e-'A'+1)*(e-'A'+1);
if((z-x+v-n+m)==temp) return 1;
return 0;
}
int main() {
freopen("in.txt","r",stdin);
while(scanf("%d%s",&temp,str)!=EOF&&(temp||strcmp(str,"END"))){
memset(max_ch,'\0',sizeof(max_ch));
memset(ch,'\0',sizeof(ch));
flag = 0;
int len = strlen(str);
for(int a=len-1;a>=0;a--){
for(int b=len-1;b>=0;b--){
if(a==b) continue;
for(int c=len-1;c>=0;c--){
if(c==b||c==a)continue;
for(int d=len-1;d>=0;d--){
if(d==a||d==b||d==c)continue;
for(int e=len-1;e>=0;e--){
if(e==a||e==b||e==c||e==d) continue;
if(cal(str[a],str[b],str[c],str[d],str[e])){
flag =1;
ch[0]=str[a],ch[1]=str[b];
ch[2]=str[c],ch[3]=str[d];
ch[4]=str[e],ch[5]='\0';
if(strcmp(ch,max_ch)>0)
strcpy(max_ch,ch);
}
}
}
}
}
}
if(flag) printf("%s\n",max_ch);
else printf("no solution\n");
}
return 0;
}