Zoj 1403 Safecracker (模拟)
来源:互联网 发布:淘宝红包套现 编辑:程序博客网 时间:2024/06/06 00:21
=== 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
YOXUZ
GHOST
no solution
#include<stdio.h>#include<string.h>#include<deque>#include<queue>#include<algorithm>using namespace std;struct String{ char str[105]; bool operator<(const String &a)const{ return strcmp(str,a.str)<0; }}a;int n;char Target[205];int Transform(int c){ return Target[c]-'A'+1;}int Mul(int x,int n){ int res=1; for(int i=0;i<n;i++)res*=x; return res;}bool Judge(int v,int w,int x,int y,int z){ int a[5]={v,w,x,y,z}; sort(a,a+5); for(int i=1;i<5;i++){ if(a[i]==a[i-1])return false; } if(v - Mul(w,2) + Mul(x,3) - Mul(y,4) + Mul(z,5) == n) return true; return false;}void Solve(){ int len=strlen(Target); priority_queue<String>q; for(int i=0; i<len; i++) { for(int j=0; j<len; j++) { for(int k=0; k<len; k++) { for(int l=0; l<len; l++) { for(int m=0; m<len; m++) { if(Judge(Transform(i),Transform(j),Transform(k),Transform(l),Transform(m))) { a.str[0]=Target[i],a.str[1]=Target[j]; a.str[2]=Target[k],a.str[3]=Target[l]; a.str[4]=Target[m]; q.push(a); } } } } } } if(!q.empty()) printf("%s\n",q.top().str); else printf("no solution\n");}int main(){ while(~scanf("%d %s",&n,Target)){ if(n==0&&strcmp(Target,"END")==0){ break; } Solve(); } return 0;}
- Zoj 1403 Safecracker (模拟)
- ZOJ 1403 Safecracker
- zoj 1403 Safecracker 枚举
- ZOJ - 1403 Safecracker
- Safecracker【ZOJ - - 1403】
- zoj 1403 Safecracker(枚举)
- ACM ZOJ Problem Set - 1403 Safecracker
- HDU 1015 Safecracker 模拟
- D - Safecracker(模拟题)
- POJ 1248 Safecracker 模拟+排序
- Safecracker
- Safecracker
- Safecracker
- Safecracker
- Safecracker
- Safecracker
- Safecracker
- Safecracker
- listView与recycleview注意事项
- 为aop设置优先级
- 前端必备SEO优化技巧
- 反编译以及代码混淆的简单介绍
- js重新渲染
- Zoj 1403 Safecracker (模拟)
- Promise、Async/Await的使用
- 出书挂名流程 出书挂名步骤
- 1003. Huffman Coding
- 数据挖掘实例(航空公司客户价值分析)
- 矩阵的零空间
- 如果在网上匿名15分钟
- flask sqlalchemy删数据报错Object '<Mydata at 0x720d710>' is already attached to session '1' (this is '3')
- vue 常用命令