ZOJ 1403&&HDU 1015 Safecracker【暴力】
=== 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."
Sample Input
1 ABCDEFGHIJKL
11700519 ZAYEXIWOVU
3072997 SOUGHT
1234567 THEQUICKFROG
0 END
Sample Output
LKEBA
no solution
no solution
no solution
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1403
题意简述:
密码序列由一系列大写字母组成,在解密序列不唯一的情况下,按字典序输出最后一个,解密公式:v - w^2 + x^3 - y^4 + z^5 = target
解题思路:
由于题目中解的值域已经确定,解元素中的v,w,x,y,z都是题目中给定集合中的一个元素,数据范围较小枚举便可。
*注意:由于题目求得是密码序列是按字典顺序的最后一个,所以再次我将之先降序排序,这样一来找到的第一个符合条件的肯定便是最后的!
题目输出可能有点问题,已更正,下面给出AC代码:
1 #include <bits/stdc++.h> 2 using namespace std; 3 char letters[15]; 4 int value[15],target; 5 void process(int len) 6 { 7 int a,b,c,d,e; 8 for(a=0;a<len;a++) 9 for(b=0;b<len;b++) 10 if(a!=b) 11 for(c=0;c<len;c++) 12 if(a!=c&&b!=c) 13 for(d=0;d<len;d++) 14 if(a!=d&&b!=d&&c!=d) 15 for(e=0;e<len;e++) 16 if(a!=e&&b!=e&&c!=e&&d!=e) 17 if(value[a]-pow(value[b],2.0)+pow(value[c],3.0)-pow(value[d],4.0)+pow(value[e],5.0)==target) 18 { 19 printf("%c%c%c%c%c\n",value[a]+'A'-1,value[b]+'A'-1,value[c]+'A'-1,value[d]+'A'-1,value[e]+'A'-1); 20 return; 21 } 22 printf("no solution\n"); 23 } 24 bool compare(int a,int b) 25 { 26 return a>b; 27 } 28 int main() 29 { 30 int i; 31 while(scanf("%d%s",&target,letters)!=EOF) 32 { 33 if(target==0&&strcmp(letters,"END")==0) 34 return 0; 35 i=0; 36 while(letters[i]) 37 { 38 value[i]=letters[i]-'A'+1; 39 i++; 40 } 41 sort(value,value+i,compare); 42 process(i); 43 } 44 return 0; 45 }
作 者:Angel_Kitty
出 处:https://www.cnblogs.com/ECJTUACM-873284962/
关于作者:阿里云ACE,目前主要研究方向是Web安全漏洞以及反序列化。如有问题或建议,请多多赐教!
版权声明:本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文链接。
特此声明:所有评论和私信都会在第一时间回复。也欢迎园子的大大们指正错误,共同进步。或者直接私信我
声援博主:如果您觉得文章对您有帮助,可以点击文章右下角【推荐】一下。您的鼓励是作者坚持原创和持续写作的最大动力!
欢迎大家关注我的微信公众号IT老实人(IThonest),如果您觉得文章对您有很大的帮助,您可以考虑赏博主一杯咖啡以资鼓励,您的肯定将是我最大的动力。thx.
我的公众号是IT老实人(IThonest),一个有故事的公众号,欢迎大家来这里讨论,共同进步,不断学习才能不断进步。扫下面的二维码或者收藏下面的二维码关注吧(长按下面的二维码图片、并选择识别图中的二维码),个人QQ和微信的二维码也已给出,扫描下面👇的二维码一起来讨论吧!!!
欢迎大家关注我的Github,一些文章的备份和平常做的一些项目会存放在这里。