hdu 1015 Safecracker
来源:互联网 发布:淘宝买家投诉恶意骚扰 编辑:程序博客网 时间:2024/05/29 14:26
=== 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
额,我让别人讲下题,结果被坑了,我让我按字典序输出,结果反翻字典序输出,不敢在懒了!
还有,求次方时,用pow()会出错!
#include<iostream>#include<cstring>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<queue>#include<map>#include<set>using namespace std;char s[30],a[10];int mark[30];int len,flag;long long n;int cmp(char aa,char bb){return aa>bb;}void dfs(int cnt){ if(flag) return; if(cnt==5){ a[5]=0; long long ta1=a[0]-64,ta2=a[1]-64,ta3=a[2]-64,ta4=a[3]-64,ta5=a[4]-64; long long tager=ta1-ta2*ta2+ta3*ta3*ta3-ta4*ta4*ta4*ta4+ta5*ta5*ta5*ta5*ta5; if(tager==n){ printf("%s\n",a); flag=1; } return; } for(int i=0;i<len;i++){ if(mark[i]) continue; mark[i]=1; a[cnt]=s[i]; dfs(cnt+1); mark[i]=0; }}int main(){ while(scanf("%lld %s",&n,s),n){ flag=0; memset(mark,0,sizeof(mark)); len=strlen(s); sort(s,s+len,cmp); dfs(0); if(!flag) printf("no solution\n"); } return 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
- Java从hdfs上读取文件中的某一行
- linux下mysql中文乱码(中文问号)解决办法
- NoHttp使用简析——Android网络请求框架(二)
- 快速获取中国省市列表的JSON数据
- [Android] 滑动 View 的原理及处理
- hdu 1015 Safecracker
- java内存模型---学习笔记
- 适配器模式
- Docker+ActiveMQ+MQTT例子
- 没神马,学习使用ShearSdk中
- C#控制台 限制小数点的位数输出
- Android Studio如何发布APK
- spring 6 bean配置--bean的作用域
- Tomcat 基于MSM做Session共享