DFS --HDOJ1015 Safecracker

DFS –HDOJ1015 Safecracker

深搜解决，注意如果有多种答案要选择字典序最大的，那么就先将所给字符升序排序，最后搜索到的字典序较大的答案会覆盖前面的答案，且要注意答案需存储，因为在最佳答案被搜索出之后，dfs可能会继续执行修改choice的值。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int passw;
int isc[13];
char all[13];
char choice[5];
char myanswer[5];
int flag;
int mcmp(char a,char b) {
    return a < b;
}
int isdq(char ch[]) {
    int v, w, x, y, z;
    v = ch[0] - 'A'+1;
    w = ch[1] - 'A'+1;
    x = ch[2] - 'A'+1;
    y = ch[3] - 'A'+1;
    z = ch[4] - 'A'+1;
    if (v - pow(w, 2) + pow(x, 3) - pow(y, 4) + pow(z, 5) == passw)
        return 1;
    else
        return 0;
}
void dfs(int deep,int alen) {
    int i;
    if (deep == 5 && isdq(choice) == 1) {
        flag = 1;
        myanswer[0] = choice[0];
        myanswer[1] = choice[1];
        myanswer[2] = choice[2];
        myanswer[3] = choice[3];
        myanswer[4] = choice[4];
        return;
    }
    if (deep >= 5)
        return;
    for (i = 0; i < alen; i++) {
        if (isc[i] == 0) {
            choice[deep] = all[i];
            isc[i] = 1;
            dfs(deep + 1, alen);
            isc[i] = 0;
        }   
    }
}
int main() {
    int i,len;
    while (scanf("%d %s", &passw, all)) {
        if (passw == 0 && strcmp(all, "END") == 0)
            break;
        for (i = 0; i < 13; i++)
            isc[i] = 0;
        flag = 0;
        len = strlen(all);
        sort(all, all + len, mcmp);
        dfs(0, len);
        if (flag == 1)
            cout << myanswer << endl;
        else
            cout <<"no solution"<<endl;
    }
}