#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int m,a,b,c,d,e;
int A,B,C,D,E;
char h[28];
bool cmp(const char &a,const char &b)
{
return (b-a)>=0?false:true;
}
int main()
{
int i,len;
while(cin>>m>>h)
{
if(m==0&&!strcmp(h,"END"))
break;
len=strlen(h);
sort(h,h+len,cmp);
int find=0;
for(a=0;a<len;a++)
{
A=h[a]-64;
for(b=0;b<len;b++)
{
if(b==a)continue;
B=h[b]-64;
for(c=0;c<len;c++)
{
if(c==a||c==b)continue;
C=h[c]-64;
for(d=0;d<len;d++)
{
if(d==a||d==b||d==c)continue;
D=h[d]-64;
for(e=0;e<len;e++)
{
if(e==a||e==b||e==c||c==d)continue;
E=h[e]-64;
unsigned long p=A-B*B+C*C*C-D*D*D*D+E*E*E*E*E;
if(p==m)
{
find=1;
break;
}
}
if(find)
break;
}
if(find)
break;
}
if(find)
break;
}
if(find)
break;
}
if(find)
cout<<h[a]<<h[b]<<h[c]<<h[d]<<h[e]<<endl;
else
cout<<"no solution"<<endl;
}
return 0;
#include<cstring>
#include<algorithm>
using namespace std;
int m,a,b,c,d,e;
int A,B,C,D,E;
char h[28];
bool cmp(const char &a,const char &b)
{
return (b-a)>=0?false:true;
}
int main()
{
int i,len;
while(cin>>m>>h)
{
if(m==0&&!strcmp(h,"END"))
break;
len=strlen(h);
sort(h,h+len,cmp);
int find=0;
for(a=0;a<len;a++)
{
A=h[a]-64;
for(b=0;b<len;b++)
{
if(b==a)continue;
B=h[b]-64;
for(c=0;c<len;c++)
{
if(c==a||c==b)continue;
C=h[c]-64;
for(d=0;d<len;d++)
{
if(d==a||d==b||d==c)continue;
D=h[d]-64;
for(e=0;e<len;e++)
{
if(e==a||e==b||e==c||c==d)continue;
E=h[e]-64;
unsigned long p=A-B*B+C*C*C-D*D*D*D+E*E*E*E*E;
if(p==m)
{
find=1;
break;
}
}
if(find)
break;
}
if(find)
break;
}
if(find)
break;
}
if(find)
break;
}
if(find)
cout<<h[a]<<h[b]<<h[c]<<h[d]<<h[e]<<endl;
else
cout<<"no solution"<<endl;
}
return 0;
}
这题是简单搜索题!