HDU 1015 Safecracker(DFS搜索)
来源:互联网 发布:mac如何新建word文档 编辑:程序博客网 时间:2024/04/29 00:19
Safecracker
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10581 Accepted Submission(s): 5410
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."
"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."
Sample Input
1 ABCDEFGHIJKL11700519 ZAYEXIWOVU3072997 SOUGHT1234567 THEQUICKFROG0 END
Sample Output
LKEBAYOXUZGHOSTno solution//简单 联系下狂搜DFS#include <iostream>#include <cstdio>#include <math.h>#include <string.h>#include <string>#include <algorithm>#include <iomanip>#include <stdlib.h>using namespace std;int re,len;bool ok;char s[20];char result[6];bool book[20];bool cmp(char a,char b){return a>=b;}void dfs(int sum,int now){if(ok) return ;if(now==5){if(sum==re)ok=1;return ;}int i;for(i=0;i<len;i++){if(book[i]==1)continue;book[i]=1;result[now]=s[i];if(now==0) dfs(sum+s[i]-'A'+1,now+1); else if(now==1) dfs(sum-(s[i]-'A'+1)*(s[i]-'A'+1),now+1); else if(now==2) dfs(sum+(s[i]-'A'+1)*(s[i]-'A'+1)*(s[i]-'A'+1),now+1); else if(now==3) dfs(sum-(s[i]-'A'+1)*(s[i]-'A'+1)*(s[i]-'A'+1)* (s[i]-'A'+1),now+1); else if(now==4) dfs(sum+(s[i]-'A'+1)*(s[i]-'A'+1)*(s[i]-'A'+1)* (s[i]-'A'+1)*(s[i]-'A'+1),now+1); book[i]=0; if(ok) return ;}}int main(){ int i,j; while(scanf("%d%s",&re,s)==2){ if(re==0&&strcmp(s,"END")==0) break; len=strlen(s); ok=0; memset(book,0,sizeof(book)); sort(s,s+strlen(s),cmp); dfs(0,0); if(ok) printf("%s\n",result); else printf("no solution\n");}return 0;}
0 0
- HDU 1015 Safecracker DFS搜索
- HDU 1015 Safecracker(DFS搜索)
- hdu 1015 Safecracker dfs()
- hdu 1015Safecracker(dfs)
- HDU 1015 Safecracker 【DFS】
- HDU 1015--Safecracker【DFS】
- hdu 1015 Safecracker【DFS】
- HDU 1015 Safecracker DFS
- HDU 1015 Safecracker (dfs)
- hdu 1015 Safecracker (dfs)
- HDU 1015 Safecracker ( DFS )
- HDU 1015 Safecracker (DFS)
- hdu 1015 Safecracker 搜索
- hdu 1015 Safecracker 暴力dfs
- hdu 1015 Safecracker【dfs 排列组合】
- HDU 1015 Safecracker (DFS)
- HDU 1015 Safecracker(DFS)
- HDOJ(HDU).1015 Safecracker (DFS)
- 147. Insertion Sort List
- 有关Apache Ignite的peer class loading (P2P class loading)
- javascript开发与调试方法
- Linux下随机10字符病毒的清除
- 题目:k数和 II
- HDU 1015 Safecracker(DFS搜索)
- MYSQL5.X重置root密码 (windows系统)
- SpringMVC简单构造restful, 并返回json——(一)
- 题目:Maximal Square
- UVALive - 5906 Smoking gun(差分约束系统+拓扑排序)
- android ListView向上滑动隐藏标题,下拉显示标题栏
- 题目:nuts 和 bolts 的问题
- 将要和正在读的软件架构书
- Android开发菜鸟到高手必备的十本畅销书籍