hdu1015 Safecracker （DFS）

Problem Description
=== Op tech briefing, 2002/11/02 06:42 CST ===
“The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World War II. Fortunately old Brumbaugh from research knew Klein’s secrets and wrote them down before he died. A Klein safe has two distinguishing features: a combination lock that uses letters instead of numbers, and an engraved quotation on the door. A Klein quotation always contains between five and twelve distinct uppercase letters, usually at the beginning of sentences, and mentions one or more numbers. Five of the uppercase letters form the combination that opens the safe. By combining the digits from all the numbers in the appropriate way you get a numeric target. (The details of constructing the target number are classified.) To find the combination you must select five letters v, w, x, y, and z that satisfy the following equation, where each letter is replaced by its ordinal position in the alphabet (A=1, B=2, …, Z=26). The combination is then vwxyz. If there is more than one solution then the combination is the one that is lexicographically greatest, i.e., the one that would appear last in a dictionary.”

v - w^2 + x^3 - y^4 + z^5 = target

“For example, given target 1 and letter set ABCDEFGHIJKL, one possible solution is FIECB, since 6 - 9^2 + 5^3 - 3^4 + 2^5 = 1. There are actually several solutions in this case, and the combination turns out to be LKEBA. Klein thought it was safe to encode the combination within the engraving, because it could take months of effort to try all the possibilities even if you knew the secret. But of course computers didn’t exist then.”

=== Op tech directive, computer division, 2002/11/02 12:30 CST ===

“Develop a program to find Klein combinations in preparation for field deployment. Use standard test methodology as per departmental regulations. Input consists of one or more lines containing a positive integer target less than twelve million, a space, then at least five and at most twelve distinct uppercase letters. The last line will contain a target of zero and the letters END; this signals the end of the input. For each line output the Klein combination, break ties with lexicographic order, or ‘no solution’ if there is no correct combination. Use the exact format shown below.”
题意：有多个测试组，每个测试组第一个数target是所要求的和，然后又一串字符，求字符串中取出5个字符v - w^2 + x^3 - y^4 + z^5 = target ，v,w,x,y,z为取出的字符，’A’代表1，’B’代表2…然后将把字典序最大的输出。
注意：字典序最大，就是按字典序排列，越往后字典序越大，12345比12354的字典序小；
思路：
1 先将接受的字符串转换为数字，即把’A’换成1…，因为要把字典序最大的输出，我们先将数字从大到小排序；
2 如何找出字典序最大?，我们可以从数组第一个开始即最大的开始放入DFS，然后找出满足条件的输出就行，因为找到的第一个即为字典序最大的；
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,s;
int mark[10000];
int a[10000],b[10000];
int vag;
bool cmp(int x,int y)
{
    return x>y;
}
void dfs(int tt)
{
    if(vag)
        return;
    if(tt==5)
    {
        if(b[0]-b[1]*b[1]+b[2]*b[2]*b[2]-b[3]*b[3]*b[3]*b[3]+b[4]*b[4]*b[4]*b[4]*b[4]==n)
        {
                printf("%c%c%c%c%c\n",b[0]+'A'-1,b[1]+'A'-1,b[2]+'A'-1,b[3]+'A'-1,b[4]+'A'-1);
                vag=1;
        }
        return;
    }
    for(int i=0;i<s;i++)
    {
        if(!mark[i])
        {
            mark[i]=1;
            b[tt]=a[i];
            dfs(tt+1);
            mark[i]=0;
        }
    }
}
int main()
{
    while(~scanf("%d",&n))
    {
        char map[10000];
        scanf("%s",map);
        if(n==0)
        {
              break;
        }
        s=strlen(map);
        for(int i=0;i<s;i++)
        {
            a[i]=map[i]-'A'+1;
        }
        sort(a,a+s,cmp);
        vag=0;
        for(int i=0;i<s;i++)
        {
            if(vag)
                break;
            memset(mark,0,sizeof(mark));
            b[0]=a[i];
            mark[i]=1;
            dfs(1);
        }
        if(!vag)
            printf("no solution\n");

    }
}