hdoj1015(暴力破解方程式)

#include<stdio.h>
#include<string>
#include<iostream>
#include <cstring>
#include<algorithm>
using namespace std;
int main()
{
char str[30];
char outstr[6];
long t,v,w,x,y,z,i,flag;
long r[26];
while(cin>>t>>str&&t!=0)
{
v=w=x=y=z=-1;
memset(r,0,sizeof(r)) ;
memset(outstr,0,sizeof(outstr)) ;
outstr[5]='\0';
flag=strlen(str);
for(i=0;i<flag;i++)
{
r[i]=str[i]-'A'+1;
}
sort(r,r+i);
for(v=0;v<i;v++)
{
for(w=0;w<i;w++)
if(w!=v)
{
for(x=0;x<i;x++)
if(x!=v&&x!=w)
{
for(y=0;y<i;y++)
if(y!=v&&y!=w&&y!=x)
{
for(z=0;z<i;z++)
if(z!=v&&z!=w&&z!=x&&z!=y)
{
if(r[v]-r[w]*r[w]+r[x]*r[x]*r[x]-r[y]*r[y]*r[y]*r[y]+r[z]*r[z]*r[z]*r[z]*r[z]==t)
{
outstr[0]=r[v]+'A'-1;outstr[1]=r[w]+'A'-1;outstr[2]=r[x]+'A'-1;
outstr[3]=r[y]+'A'-1;outstr[4]=r[z]+'A'-1;
}
}
}
}
}
}
if(outstr[0]=='\0')
{
cout<<"no solution"<<endl;

}
else
{
cout<<outstr<<endl;
}
}
return 0;
}