zoukankan      html  css  js  c++  java
  • hdu1015 Safecracker (暴力枚举)

    http://acm.hdu.edu.cn/showproblem.php?pid=1015

    Safecracker

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

    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
     
    Source
     
    Recommend
    JGShining
     


    五重循环 AC~

    暴力无处不在~

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <functional>
    #include <algorithm>
    using namespace std;
    int a[15];
    int sum, n;
    
    void solve() {
        int v, w, x, y, z;
        for(v=0; v<n; v++)
           for(w=0; w<n; w++)
              if(w!=v)
                 for(x=0; x<n; x++)
                    if(x!=v&&x!=w)
                       for(y=0; y<n; y++)
                           if(y!=v&&y!=w&&y!=x)
                              for(z=0; z<n; z++)
                                 if(z!=v&&z!=w&&z!=x&&z!=y) {
    				if(sum == a[v]-a[w]*a[w]+a[x]*a[x]*a[x]-a[y]*a[y]*a[y]*a[y]+a[z]*a[z]*a[z]*a[z]*a[z]) {
      				   printf("%c%c%c%c%c
    ",a[v]+'A'-1,a[w]+'A'-1,a[x]+'A'-1,a[y]+'A'-1,a[z]+'A'-1);
                            	   return ;
                                   	}
                                 }
         printf("no solution
    ");
    }
    int main() {
        int i;
        char str[15];
        while(scanf("%d%s",&sum,str),sum) {
            n =strlen(str);
            for(i=0; i<n; i++)
                a[i] = str[i]-'A'+1;
            sort(a,a+n,greater<int>());
            solve();
        }
        return 0;
    }
    


  • 相关阅读:
    学习 Web 开发技术的16个最佳教程网站和博客
    将会改变未来IT世界的十种编程语言
    用来理解 Java 编程语言的 8 个图表
    花样Android ProgressBar
    Android控件TextProgressBar进度条上显文字
    ViewFlipper 在同一背景下 页面左右滑动
    Android自定义进度条-带文本(文字进度)的水平进度条(ProgressBar)
    android用户界面之GridView教程实例汇总
    禁止ScrollView在子控件的布局改变时自动滚动的的方法
    ListView中使用自定义Adapter及时更xin
  • 原文地址:https://www.cnblogs.com/snake-hand/p/3206316.html
Copyright © 2011-2022 走看看