hdoj 1015 Safecracker【DFS】
来源:互联网 发布:51单片机与蓝牙模块 编辑:程序博客网 时间:2024/05/20 07:32
Safecracker
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10612 Accepted Submission(s): 5429
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
Source
Mid-Central USA 2002
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>using namespace std;int a[100],b[100],vis[100];char s[100],c[100];int tar,flag,len;void dfs(int n){if(n==5){if(tar==(b[0]-pow(b[1],2)+pow(b[2],3)-pow(b[3],4)+pow(b[4],5))){flag = 1;for(int i = 0; i < n; i++)c[i] = b[i]+64;}return;}for(int i = 0; i < len;i++){if(!vis[i]){vis[i] = 1;b[n] = a[i];dfs(n+1);vis[i] = 0;}}}int main(){int i,j,k;while(scanf("%d %s",&tar,s)!=EOF){if(tar==0&&strcmp(s,"END")==0)break;flag = 0;memset(vis,0,sizeof(vis));len = strlen(s);sort(s, s+len);for(i = 0;i < len;i ++)a[i] = s[i]-64;dfs(0 );if(!flag)printf("no solution");elsefor(i = 0;i < 5; i++)printf("%c",c[i]);printf("%\n");}return 0;}
0 0
- hdoj 1015 Safecracker 【dfs】
- HDOJ 1015 Safecracker-DFS
- hdoj 1015 Safecracker【DFS】
- hdoj 1015 Safecracker 【DFS】
- HDOJ-1015Safecracker(DFS)
- HDOJ 1015 Safecracker(DFS)
- HDOJ(HDU).1015 Safecracker (DFS)
- HDOJ 题目1015 Safecracker(dfs)
- hdoj 1015 Safecracker(窃贼) Dfs
- HDOJ 1015 Safecracker
- HDOJ 1015 Safecracker
- hdu/hdoj 1015 Safecracker
- HDOJ 1015 Safecracker
- HDOJ 1015 Safecracker
- hdoj 1015 Safecracker
- HDOJ HDU 1015 Safecracker
- hdoj 1015 Safecracker
- HDOJ 1015 Safecracker
- Android-主题样式基本方式
- 计算机网络面试题3
- java 第三天---数据类型和运算符
- AutoCompleteTextView控件学习
- LeetCode题解:Majority Element
- hdoj 1015 Safecracker【DFS】
- Linux Desktop Entry 文件深入解析
- LeetCode题解:Compare Version Numbers
- css图片垂直居中
- [C++11 并发编程] 12 使用条件变量创建线程间安全的队列
- Activity之间信息传递(参数传递)
- Android内存泄露检测利器---LeakCanary
- Python游戏服务器开发日记(四)scons编译工具、C和C++混合使用
- 网络方面的面试题