杭电 1015 Safecracker
来源:互联网 发布:大数据平台架构师 编辑:程序博客网 时间:2024/05/17 02:34
Safecracker
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9845 Accepted Submission(s): 5026
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
特别注意pow函数是double型,有精度截断情况,要加上EPS,
#include<stdio.h>#include<math.h>#include<string.h>#define EPS 1e-6char a[100],c[100];char out[100];int flag[100]={0};void bfs(int now,int len,int nowp,int p){ if(now==6) { if(nowp==p) { int t; if(strcmp(c,out)>0) { strcpy(out,c); } } return; } int i; for(i=0;i<len;i++) { if(flag[i]==1) continue; if(now==1||now==3||now==5) { nowp=nowp+(int)(pow((a[i]-'A'+1),now)+EPS); } else if(now==2||now==4) { nowp=nowp-(int)(pow((a[i]-'A'+1),now)+EPS); } flag[i]=1; c[now-1]=a[i]; bfs(now+1,len,nowp,p); flag[i]=0; if(now==1||now==3||now==5) { nowp=nowp-(int)(pow((a[i]-'A'+1),now)+EPS); } else if(now==2||now==4) { nowp=nowp+(int)(pow((a[i]-'A'+1),now)+EPS); } }}int main(){ int target; while(scanf("%d",&target)!=EOF) { getchar(); gets(a); strcpy(out,"AAAAA"); if(target==0&&strcmp(a,"END")==0) break; bfs(1,strlen(a),0,target); if(strcmp(out,"AAAAA")==0) printf("no solution\n"); else puts(out); memset(c,0,sizeof(c)); } return 0;}
0 0
- 杭电 1015 Safecracker
- 杭电 1015 Safecracker
- 杭电 1015 Safecracker
- 杭电1015 Safecracker 暴力
- 杭电 ACM 1015 --Safecracker
- 杭电OJ 1015 Safecracker
- 杭电-1015Safecracker(DFS)
- 杭电 HDU ACM 1015 Safecracker (dfs 枚举排列)
- 杭电1796 Safecracker(DFS)
- 杭电ACM1015——Safecracker
- 杭电1015——Safecracker(dfs、递归枚举排列)
- 杭电ACM OJ 1015 Safecracker 优雅的5重for循环轻松解决v
- 1015 Safecracker
- HDU - 1015 Safecracker
- HDOJ 1015 Safecracker
- HDU 1015 Safecracker
- HDU 1015 Safecracker
- Hdu 1015 Safecracker
- Spring MVC中下载文件
- golang的小总结
- 欢迎使用CSDN-markdown编辑器
- 一位软件工程师的6年总结
- 使用android studio导入之前版本系统的project sync failed 解决办法
- 杭电 1015 Safecracker
- python tips - 注意函数参数的默认值-默认参数-可选参数
- QML之javascript
- 尼泊尔部分地方成"孤岛" 死亡人数或过万
- Android之圆形(圆角)图片的实现(一)
- 免费DNS解析服务:
- linux命令英文缩写的含义(方便记忆)
- GAEA Winlog v4.50 1CD(创建钻井日志和测井曲线的工具) GAEA Winsieve v1.2 1CD(快速输入和打印结晶粒度分析曲线)
- Jlink_V8灯不亮USB无法识别及克隆版问题解决方法(win7 64位系统下亲测可用)