hdu1015
来源:互联网 发布:免费负载均衡软件 编辑:程序博客网 时间:2024/05/17 01:50
=== 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<iostream>#include<algorithm>#include<cstring>#include<string>#include<stdio.h>#include<cmath>using namespace std;int target,n;char t[13],kk[13];bool flag;struct Nod{ char temp; bool visited;}array[13];int cmp(Nod a,Nod b){ if(a.temp > b.temp) return 1; else return 0;}void DFS(int k){ if(k == 5) { if(((t[0] - 'A'+1) - (t[1] - 'A' + 1)*(t[1] - 'A' + 1) + (t[2]-'A'+1)*(t[2]-'A'+1)*(t[2]-'A'+1) - (t[3] - 'A' + 1)*(t[3]-'A'+1)*(t[3]-'A'+1)*(t[3]-'A'+1) + (t[4] - 'A' + 1)*(t[4]-'A'+1)*(t[4]-'A'+1)*(t[4]-'A'+1)*(t[4]-'A'+1)) == target) { if(strcmp(t,kk) > 0) { strcpy(kk,t); } } return; } for(int j = 0;j < n;j++) { if(!array[j].visited) { t[k] = array[j].temp; array[j].visited = true; DFS(k + 1); array[j].visited = false; } }}int main(){ string str; int i,j,k; while(cin>>target>>str) { n = str.length(); if(target == 0 && str == "END") break; memset(t,'\0',sizeof(t)); memset(kk,'\0',sizeof(kk)); for(i = 0;i < n;i++) { array[i].temp = str[i]; array[i].visited = false; } sort(array,array+n,cmp); DFS(0); if(strlen(kk) == 0) cout<<"no solution"<<endl; else cout<<kk<<endl; } return 0;}
0 0
- hdu1015
- hdu1015
- hdu1015
- hdu1015
- hdu1015
- hdu1015
- HDU1015
- HDU1015
- hdu1015
- hdu1015
- HDU1015
- HDU1015
- HDU1015 Safecracker
- hdu1015深搜
- HDU1015 Safecracker
- hdu1015(Safecracker )
- Safecracker HDU1015
- hdu1015(枚举)
- CSS的margin塌陷(collapse)
- 博客汇总整理
- #10 D. LCIS (dp+最长公共上升子序列)
- HOW TO TALK ABOUT VARIOUS PRACTIONERS学习笔记
- 使用DEAP基于K-means的情感计算
- hdu1015
- kill –HUP 1234 >killout.txt 2 >killerr.txt
- NET服务端开发—多线程使用小结(多线程使用常识)
- VMware添加新硬盘
- html5 meta(移动端)介绍及使用
- hzau 1207 Candies(线段树 区间更新 区间查询)
- codeforces Kidnapping
- 移动端开发遇到的坑
- 【java并发】基础(2)--线程中断和终止