#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
bool right(int a[],int target)
{
return a[0]-a[1]*a[1]+a[2]*a[2]*a[2]-a[3]*a[3]*a[3]*a[3]+a[4]*a[4]*a[4]*a[4]*a[4] == target;
}
int main()
{
int target;
string alph;
while(cin>>target>>alph)
{
if(!target && alph=="END")break;
int a[5];
sort(alph.begin(),alph.end());
for(int i1=alph.length()-1;i1>=0;i1--)
{
for(int i2=alph.length()-1;i2>=0;i2--)
{
if(i1==i2)continue;
for(int i3=alph.length()-1;i3>=0;i3--)
{
if(i2==i3)continue;
for(int i4=alph.length()-1;i4>=0;i4--)
{
if(i3==i4)continue;
for(int i5=alph.length()-1;i5>=0;i5--)
{
if(i4==i5)continue;
a[0]=alph[i1]-64;
a[1]=alph[i2]-64;
a[2]=alph[i3]-64;
a[3]=alph[i4]-64;
a[4]=alph[i5]-64;
string s;
if(right(a,target))
{
cout<<s+alph[i1]+alph[i2]+alph[i3]+alph[i4]+alph[i5]<<endl;
goto next;
}
}
}
}
}
}
cout<<"no solution"<<endl;
next:;
}
return 0;
}
HDU1015 5层循环暴力法
猜你喜欢
转载自blog.csdn.net/artistkeepmonkey/article/details/86701590
今日推荐
周排行