zoukankan      html  css  js  c++  java
  • HDU 1015 Safecracker(DFS)

    Safecracker

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 6494    Accepted Submission(s): 3238


    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."
     
    Sample Input
    1 ABCDEFGHIJKL 11700519
    ZAYEXIWOVU 3072997
    SOUGHT 1234567
    THEQUICKFROG 0
    END
     
    Sample Output
    LKEBA
    YOXUZ
    GHOST
    no solution
    题意:用给出的字母运算出 给出的数字
    先把字符串按大到小排好顺序后,暴力枚举。注意浮点和整形的转换,pow()要加上0.5,不然会有错。
     1 #include<cstdio>
     2 #include<cmath>
     3 #include<cstring>
     4 #include<iostream>
     5 #include<algorithm>
     6 char t[6],s[27];
     7 int vis[27],a[27];
     8 bool Go;
     9 int N,len;
    10 bool cmp(char a,char b)
    11 {
    12     return a > b;
    13 }
    14 void dfs(int k)
    15 {
    16     if(Go == true )return ;
    17     if(k == 5){//0.5要加
    18         int sum = a[t[0]-'A']-(int)(pow(a[t[1]-'A'],2)+0.5)+(int)(pow(a[t[2]-'A'],3)+0.5)-
    19            (int)(pow(a[t[3]-'A'],4)+0.5)+(int)(pow(a[t[4]-'A'],5)+0.5);
    20         if(N==sum){
    21            printf("%s
    ",t);
    22            Go = true;
    23         }
    24         return ;
    25     }
    26     for(int i=0; i<len; i++){
    27         if(!vis[s[i]-'A'])
    28         {
    29             t[k] = s[i];
    30             vis[s[i]-'A'] = 1;
    31             dfs(k+1);
    32             vis[s[i]-'A'] = 0;
    33         }
    34     }
    35 }
    36 int main()
    37 {
    38     int i;
    39     for(i=0;i<26;i++)a[i] = i+1;
    40     while(~scanf("%d",&N)){
    41         memset(t,'',sizeof(t));
    42         memset(vis,0,sizeof(vis));
    43         scanf("%s",s);
    44         if( !N && strcmp(s,"END")==0)break;
    45         len = strlen(s);
    46         std::sort(s,s+len,cmp);
    47         Go = false;
    48         dfs(0);
    49         if(Go==false)printf("no solution
    ");
    50     }
    51     return 0;
    52 }
    View Code
  • 相关阅读:
    《自拍教程76》Python 一键批量安装第三方包
    Java 在 PDF 中添加表单域
    Spire.Cloud.Word 加密 Word 文档
    Java 添加超链接到 Word 文档
    为什么java8还在被大量使用?
    要替代C和Java 的后浪,现在混得怎么样?
    学习Java之前是否需要学习HTML
    半路出家学习Java是否能学出来
    学习Java语言有什么好处?
    Java只有中国开发者在用了吗?
  • 原文地址:https://www.cnblogs.com/qiu520/p/3250362.html
Copyright © 2011-2022 走看看