HDU 1015 Safecracker
来源:互联网 发布:淘宝女鞋正品 编辑:程序博客网 时间:2024/06/14 06:31
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
Recommend
题意很简单,抽出一些英文字母使得等式成立并且字典序最大,排序后从大到小搜一遍就好了。
#include<iostream>#include <algorithm>#include <cmath>#include <cstdio>#include <cstring>#include <queue>using namespace std;typedef long long ll;const int maxn=50;int a[maxn];char s[maxn];int vis[maxn];int x,len;int pow(int x,int b){ int res=1; for(int i=0; i<b; i++) res*=x; if(b&1) return res; return -res;}int dfs(int sum,int num){ if(num==5) { if(sum==x) return 1; else return 0; } for(int i=len-1; i>=0; i--) { if(!vis[i]) { vis[i]=1; int xx=s[i]-'A'+1; a[num]=xx; if(dfs(sum+pow(xx,num+1),num+1)) return 1; vis[i]=0; } } return 0;}int main(){ while(cin>>x>>s) { if(x==0 &&strcmp(s,"END")==0) break; memset(vis,0,sizeof(vis)); memset(a,0,sizeof(a)); len=strlen(s); sort(s,s+len); if(dfs(0,0)) { for(int i=0; i<5; i++) printf("%c",a[i]-1+'A'); } else printf("no solution"); printf("\n"); } return 0;}
0 0
- HDU - 1015 Safecracker
- HDU 1015 Safecracker
- HDU 1015 Safecracker
- Hdu 1015 Safecracker
- hdu 1015 Safecracker
- hdu 1015 Safecracker(枚举)
- hdu 1015 Safecracker
- hdu 1015 Safecracker
- HDU 1015 Safecracker(深搜)
- hdu 1015 Safecracker
- hdu 1015 Safecracker dfs()
- hdu 1015 Safecracker
- HDU 1015 Safecracker
- hdu(1015)Safecracker
- hdu/hdoj 1015 Safecracker
- hdu 1015 Safecracker
- hdu 1015 Safecracker
- hdu 1015 Safecracker
- Q字首类破解补丁速查
- HDU 4545 魔法串(西山居挑战赛)
- 【RMAN】数据库备份之冷备份
- GitHub for Windows 安装失败,An error occurred attempting to install github 的解决办法
- 拷贝数据库到沙盒
- HDU 1015 Safecracker
- leetcode283 : Move Zeroes
- 地图的使用(定位)
- 如果要查找%'或'_',则需要使用关键字ESCAPE定义一个转义符号
- MVC3 Html.DropDownList使用方法总结
- OpenGL几何变换
- C++ Primer 学习笔记与思考_11 try..catch语句及相关疑点
- S-functions
- 折腾CentOS--让linux启动后自动进入图形界面或文本界面