练习点:DFS(区别1011,本例输出固定长度,HDOJ1011 )
http://acm.hdu.edu.cn/showproblem.php?pid=1015
Tips:
1. cout,cin以及iostream的大量使用会严重降低速度,导致Time Limit Exceeded,以及极大的output size消耗。尽量使用stdio中的。
2. getchar()命令读取单个字符
3. cin.getline(lett_set, 13,'\n');//注意是13最多能读取12个字符长度的字符串
4. 利用gets(temp); 读取一行中的内容。temp必须为char temp[N], 不能使用char* temp;
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int number;
char letter_set[13];
unsigned char result[5];
int length;
bool flag;
bool visited[12];
//int global;
bool cmp(char a, char b)
{
<span style="white-space:pre"> </span>return a>b;
}
inline bool IsNumber()//const unsigned char num[5])
{
int tmp_num = result[0] - result[1]*result[1] + result[2]*result[2]*result[2] - result[3]*result[3]*result[3]*result[3]
+ result[4]*result[4]*result[4]*result[4]*result[4];
return (tmp_num == number);
}
void Safecracker(int deep)
{
<span style="white-space:pre"> </span>if (deep == 5)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>if (IsNumber())
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>flag = true;<span style="white-space:pre"> </span>
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span> return;//此处不return,会导致找不到结果,到达深度就要停止,而不是找到结果才返回。
<span style="white-space:pre"> </span> //此处没有返回少了很多可能
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>for (int i = 0 ; i < length; i++)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>if (!visited[i])
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>//global++;
<span style="white-space:pre"> </span>result[deep] = letter_set[i];
<span style="white-space:pre"> </span>visited[i] = true;
<span style="white-space:pre"> </span>Safecracker(deep + 1);
<span style="white-space:pre"> </span>if (flag) //此处不return, 会导致不是最大的,递推后面一定要有return让其结束
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>return;
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>visited[i] = false;
<span style="white-space:pre"> </span>}<span style="white-space:pre"> </span>
<span style="white-space:pre"> </span>}<span style="white-space:pre"> </span>
}
int main()
{
<span style="white-space:pre"> </span>while (true)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>scanf("%d", &number);
<span style="white-space:pre"> </span>getchar();
<span style="white-space:pre"> </span>gets(letter_set);
<span style="white-space:pre"> </span>if (number==0 && strcmp(letter_set, "END")==0)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>break;
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>flag = false;
<span style="white-space:pre"> </span>memset(visited, 0, sizeof(visited));
<span style="white-space:pre"> </span>length = strlen(letter_set);
<span style="white-space:pre"> </span>for (int i = 0; i < length; i++)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>letter_set[i]+=(-'A'+1);
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>sort(letter_set, letter_set+length, cmp);
<span style="white-space:pre"> </span>Safecracker(0);
<span style="white-space:pre"> </span>//printf("%d\n", global);
<span style="white-space:pre"> </span>if (flag)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>for (int i = 0; i <5; i++)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>result[i] -= (-'A'+1);
<span style="white-space:pre"> </span>printf("%c", result[i]);
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>printf("\n", result);
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>else
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>printf("no solution\n");
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>return 0;
}