Poj1248 Safecracker

Poj1248 http://poj.org/problem?id=1248

#include <iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int tar,g[30],ls,ans[5];
char s[30];
bool check_end(char s[])
{
    if(strlen(s)!=3)return 0;
    return s[0]=='E'&&s[1]=='N'&&s[2]=='D';
}//v - w2+ x3- y4+ z5= target
int poww()
{

    return ans[0]-ans[1]*ans[1]+pow(ans[2],3)-pow(ans[3],4)+pow(ans[4],5);
}
bool check()
{
    for (int i = 1; i < 5; i++){
        for (int j =0 ; j < i; j++)
            if (ans[i] == ans[j]) return 0;
    }
    return tar==poww();
}
bool search(int w)
{
    if(w>4) return check();
    for(int i=0;i<ls;i++)
    {
        ans[w]=g[i];
        if(search(w+1)) return 1;
    }
    return 0;
}
int main()
{
    while(cin>>tar>>s)
    {
        if(tar==0&&check_end(s)) {break;}
        ls=strlen(s);
        for(int i=0;i<ls;i++) {g[i]=s[i]-'A'+1;}
        sort(g,g+ls,greater<int>());

        if(search(0))
        {
           for(int i=0;i<5;i++) {char c='A'+ans[i]-1; cout<<c;}
           cout<<endl;
        }
        else{ cout<<"no solution"<<endl;}
    }
    return 0;
}

1.char[]的长度 char s[30]; strlen(s)
2.sort(g,g+l,greater()); 表示从大到小的排序 头文件为algorithm
3.暴力枚举真香