hdu1015(枚举)
来源:互联网 发布:ubuntu和kali 编辑:程序博客网 时间:2024/04/30 04:47
Safecracker
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8742 Accepted Submission(s): 4428
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1015Total Submission(s): 8742 Accepted Submission(s): 4428
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解题思路: 先把字母从大到小按字典序排个序,然后5层循环遍历,注意5个字母要求不能重复,同时可以不严格按照升序或降序排列,所以每次都要从0到len遍历,并且保证所选字母不相同。这样找到后保证是最大的。完整代码:#include <functional>#include <algorithm>#include <iostream>#include <fstream>#include <sstream>#include <iomanip>#include <numeric>#include <cstring>#include <climits>#include <cassert>#include <complex>#include <cstdio>#include <string>#include <vector>#include <bitset>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <list>#include <set>#include <map>using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")typedef long long LL;typedef double DB;typedef unsigned uint;typedef unsigned long long uLL;/** Constant List .. **/ //{const int MOD = int(1e9)+7;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f3f3f3f3f3f3fLL;const DB EPS = 1e-9;const DB OO = 1e20;const DB PI = acos(-1.0); //M_PI;int n;char s[100001];bool cmp(char a , char b){ return a > b;}int main(){ #ifdef DoubleQ freopen("in.txt","r",stdin); #endif while(cin >> n >> s) { if(n == 0 && strcmp(s , "END") == 0) break; int len = strlen(s); sort(s , s + len , cmp); int flag = 0; int v , w , x , y , z; for(v = 0 ; v < len ; v ++) { for(w = 0 ; w < len ; w ++) { if(v != w) { for(x = 0 ; x < len ; x ++) { if(v != x && w != x) { for(y = 0 ; y < len ; y ++) { if(v != y && x != y && w != y) { for(z = 0 ; z < len ; z ++) { if(v != z && y != z && x != z && w != z) { int a = s[v] - 'A' + 1; int b = s[w] - 'A' + 1; int c = s[x] - 'A' + 1; int d = s[y] - 'A' + 1; int e = s[z] - 'A' + 1; if( a - b * b + c * c * c - d * d * d * d + e * e * e * e * e == n) { flag = 1; break; } } } if(flag) break; } } if(flag) break; } } if(flag) break; } } if(flag) break; } if(flag) cout << s[v] << s[w] << s[x] << s[y] << s[z] << endl; else cout << "no solution" << endl; }}
0 0
- hdu1015(枚举)
- hdu1015 Safecracker (暴力枚举)
- hdu1015(暴力枚举。。。。)
- HDU1015(暴力枚举)
- hdu1015
- hdu1015
- hdu1015
- hdu1015
- hdu1015
- hdu1015
- HDU1015
- HDU1015
- hdu1015
- hdu1015
- HDU1015
- HDU1015
- 用DFS实现排列和组合两种枚举方式【附带例题HDU1015,POJ1753题解】
- HDU1015 Safecracker
- 读《影响力》总结
- 链接重定位和装载重定位
- c/c++ ctags cscope
- [0001] CentOS7下部署nginx+mongrel+rails环境
- OpenCV原理解读之HAAR+Adaboost
- hdu1015(枚举)
- hdu1019最小公倍数
- 怀鲁迅
- Cocos2D-x Node知识集
- Unable to execute dex: Multiple dex files define
- CLAPACK在Windows上的编译、安装与使用
- bzoj1013: [JSOI2008]球形空间产生器sphere[Guass消元]
- (模板)逆元
- oAuth