HDU 1015.Safecracker【暴力枚举】【8月17】
来源:互联网 发布:centos 网络配置文件 编辑:程序博客网 时间:2024/05/16 18:01
Safecracker
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>int f[30],target;int main(){ char s[30]; while(scanf("%d%s",&target,s)!=EOF&&target){ memset(f,0,sizeof(f)); if(strlen(s)<5){ printf("no solution"); break; } bool key=false; for(int i=0;i<strlen(s);i++) f[s[i]-'@']=1; for(int a=26;a>0&&!key;a--) for(int b=26;b>0&&!key;b--){ if(b!=a) for(int c=26;c>0&&!key;c--){ if(c!=b&&c!=a) for(int d=26;d>0&&!key;d--){ if(d!=c&&d!=b&&d!=a) for(int e=26;e>0&&!key;e--){ if(e!=d&&e!=c&&e!=b&&e!=a) if(f[a]&&f[b]&&f[c]&&f[d]&&f[e]) if(a-b*b+c*c*c-d*d*d*d+e*e*e*e*e==target){ key=true; printf("%c%c%c%c%c\n",(char)a+64,(char)b+64,(char)c+64,(char)d+64,(char)e+64); } } } } } if(!key) printf("no solution\n"); } return 0;}
0 0
- HDU 1015.Safecracker【暴力枚举】【8月17】
- HDU 1015 Safecracker (暴力枚举)
- HDOJ/HDU 1015 Safecracker(枚举、暴力)
- hdu1015 Safecracker (暴力枚举)
- Safecracker(枚举暴力)
- hdu 1015 Safecracker 暴力
- poj 1248 Safecracker(暴力枚举)
- hdu 1015 Safecracker(枚举)
- hdu 1015 Safecracker 枚举
- hdu 1015 Safecracker 枚举
- hdu 1015 Safecracker 暴力dfs
- hdoj 1015 safecracker(暴力枚举)
- HDU ACM 1015 Safecracker 暴力DFS
- hdu 1015 Safecracker(暴力枚举,注意它要求按字典序最大的,所以开始要排序)
- Safecracker--简单暴力枚举(Problem ID:1015)
- hdu 3332 暴力枚举
- HDU 3823 暴力枚举
- hdu 3720 暴力枚举
- OAF学习笔记-5-点击按钮页面跳转
- 怎么样部署新的code到一个集群里
- 第二天 Java基本语法(一)
- 根绝exe名字获取进程ID
- 不同噪声下滤波器的选择
- HDU 1015.Safecracker【暴力枚举】【8月17】
- 黑马程序员-----Java基础-----String
- linux 生名变量类型 declare
- 根据指定颜色生成图片
- Agar 流体效果的 Cocos2d-JS 实现
- hadoop MR 任务 报错 "Error: java.io.IOException: Premature EOF from inputStream at org.apache.hadoop.io"
- 归因的偏差
- MongoDB Shell常用命令
- Android------以后进先出的方式加载图片