HDU 1015 Safecracker 【DFS】
来源:互联网 发布:白城广逸网络地点 编辑:程序博客网 时间:2024/04/28 15:50
Safecracker
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8858 Accepted Submission(s): 4479
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
搜索题,每个输出可能有很多解,输出字典序最大的那个。
*/
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int target,len,a[110],ans[110],visit[110],flag;int cmp(int a,int b){ return a>b;}int charge(char* s){ len=strlen(s); for(int i=0; i<len; i++) { a[i]=s[i]-'A'+1; } return len; }void dfs(int step){ if(!flag) return; if(step==5)//要和下面那个if()分开写,否则会超时 { if(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]==target) { flag=0; printf("%c%c%c%c%c\n",ans[0]+'A'-1,ans[1]+'A'-1,ans[2]+'A'-1,ans[3]+'A'-1,ans[4]+'A'-1); } return; } else { for(int i=0; i<len; i++) { if(!visit[i]) { ans[step]=a[i]; visit[i]=1; dfs(step+1); visit[i]=0; } } } }int main(){ char s[110]; while(scanf("%d %s",&target,s)) { flag=1; if(target==0&&strcmp(s,"END")==0) break; len=charge(s); sort(a,a+len,cmp); memset(visit,0,sizeof(visit)); dfs(0); if(flag) printf("no solution\n"); } return 0;}
0 0
- 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 暴力dfs
- HDU 1015 Safecracker DFS搜索
- HDU 1015 Safecracker(DFS搜索)
- hdu 1015 Safecracker【dfs 排列组合】
- HDU 1015 Safecracker (DFS)
- HDU 1015 Safecracker(DFS)
- HDOJ(HDU).1015 Safecracker (DFS)
- HDU Safecracker 1015(dfs入门)
- [Leetcode]Jump Game && Jump Game II
- 琐碎事情
- jsoup:解析HTML用法小结
- 心跳数据采集及简单处理-黄
- cannot be used as a boolean
- HDU 1015 Safecracker 【DFS】
- 9个完整android开源app项目
- poj 2569 Etaoin Shrdlu 统计字符频率
- 危险代码:如何使用Unsafe操作内存中的Java类和对象—Part4
- 求平均成绩(杭电2023)(确实很水很繁琐)
- Thrift官方安装手册(译)
- .NET基础之迭代器
- 相同中的不同:Java程序员应该停止低看C#
- UVA - 10271 Chopsticks 经典DP