HDU 1015 Safecracker (dfs)

题目的链接如下：http://hdu.hustoj.com/showproblem.php?pid=1015
=== 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.”
Input
1 ABCDEFGHIJKL
11700519 ZAYEXIWOVU
3072997 SOUGHT
1234567 THEQUICKFROG
0 END
Output
LKEBA
YOXUZ
GHOST
no solution

题目的大意就是说，给你一个数和一个字符串，如果字符串中的字母对应的数字（字母的大小转换成数字就是x-‘A’+1）满足
v - w^2 + x^3 - y^4 + z^5 = target 这样一个表达式就行，输出V最大的那种。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int target;//需要输入的答案
int ans[50];
int a[50];
char maze[50];
int vis[50];
int len;//字符串的长度

bool cmp(int a,int b){
    return a > b;//从大到小
}


int dfs(int dep){//深度，表示走了几步，就是找了几个数了；
    if(dep == 5){
        int temp = ans[0] - ans[1] * ans[1] + ans[2] * ans[2] * ans[2] - ans[3] * ans[3] * ans[3] * ans[3] + ans[4] * ans[4] * ans[4] * ans[4] * ans[4];
        if(temp == target)
            return 1;
        else
            return 0;
    }
    for(int i = 0 ; i < len ; i++){
        if(vis[i] == 0){
            vis[i] = 1;
            ans[dep] = a[i];
            if(dfs(dep+1))
                return 1;
            vis[i] = 0;
        }
    }
    return 0;
}

int main()
{

    while(scanf("%d%s", &target, maze) && ( target != 0 || strcmp(maze, "END" ) != 0)){
        len = strlen(maze);
        for( int i = 0; i < len; i++ ){
            a[i] = maze[i] - 'A' + 1;
        }
        sort(a, a+len, cmp);
        memset(ans, 0, sizeof(ans));
        memset(vis, 0, sizeof(vis));
        if(dfs(0)){
            for(int i = 0; i < 5; i++)
                printf("%c", ans[i] + 'A' - 1 );
        }
        else cout << "no solution";
        cout << endl;
    }
    return 0;
}