杭电-1015Safecracker(DFS)
2015-10-28 21:13
411 查看
Safecracker
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10906 Accepted Submission(s): 5584
[align=left]Problem Description[/align]
=== 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."
[align=left]Sample Input[/align]
1 ABCDEFGHIJKL 11700519 ZAYEXIWOVU 3072997 SOUGHT 1234567 THEQUICKFROG 0 END
[align=left]Sample Output[/align]
LKEBA YOXUZ GHOST no solution
题目没读完,大致懂了啥意思,就是前面给个数,后面给个字符串,A对应1,B对应2......,依次类推,要你跳出5个字符使得 v - w^2 + x^3 - y^4 + z^5 = target
必须要遍历所有的情况,所以dfs不解释!
另外,字典序的意思就是strcmp(s1,s2)>0就取s1
代码:
#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #define INF 0x3f3f3f3f using namespace std; int t,len,used[100]; char str[100],best[6],str1[100]; int bes; bool is_solution(char s[]) { int r=s[0]-'A'+1-(s[1]-'A'+1)*(s[1]-'A'+1)+pow(s[2]-'A'+1,3)-pow(s[3]-'A'+1,4)+pow(s[4]-'A'+1,5); if(r==t) return true; return false; } void dfs(int x) { int i; if(x>=5) { if(is_solution(str1)) { if(strcmp(str1,best)>0) { for(i=0;i<5;i++) best[i]=str1[i]; } } return ; } else{ for(i=0;i<len;i++) { if(!used[i]) { str1[x]=str[i]; used[i]=1; dfs(x+1); used[i]=0; } } } } int main() { while(scanf("%d%s",&t,str),t&&strcmp(str,"END\0")) { memset(used,0,sizeof(used)); memset(best,'0',sizeof(best)); len=strlen(str); bes=INF; dfs(0); best[5]='\0'; if(best[0]=='0') printf("no solution\n"); else printf("%s\n",best); } return 0; }
相关文章推荐
- 通过SharedPreferences存储和显示信息
- HTML5 中的可缩放矢量图形(SVG)
- JS高级程序设计读书笔记(第十三章 事件)
- node.js_in_practice(intermediate)
- JS图片放大查看的3种方案
- 深入理解javascript之IIFE
- 常见的2种HTML5错误语法
- JS完美运动框架
- 8、第八次课jquery第一节20151006
- html-表单的应用
- 京东首页很炫的js效果、图片自动滑动,悬停效果,鼠标离开效果
- javascript基础之confirm
- 天气API整理,返回的数据格式为json对象
- CSS盒模型
- JS中通过建立类来防止方法重载
- javascript入门
- Css3文本新属性
- JS对象在用于搜索和分析数据上表现出十分便捷的作用,它们甚至连排列数字也不费吹灰之力
- jQuery延迟对象deferred的使用
- LeetCode 117: Populating Next Right Pointers in Each Node II