zoukankan      html  css  js  c++  java
  • 杭电1015--Safecracker(Dfs)

    Safecracker

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


    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   |   We have carefully selected several similar problems for you:  1238 1072 1240 1372 1026 
    搜索40道, 原谅渣渣的自我满足。 暴力可以过, 注意字典序。 判断很巧妙。
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #define N 15
    using namespace std;
    char str[N], dis[N]; 
    int len, sum, vis[N];
    int pow(int a, int b){
        int ans = 1;
        for(int i = 0; i < b; i++)
            ans *= a;
        return b%2? ans:-ans; 
    }
    int Dfs(int b, int a){
        if(a == 5) 
            return b == sum;
        for(int i = len-1; i >= 0; i--){
            if(vis[i])
                continue;
                vis[i] = 1;
                dis[a] = str[i];
                if(Dfs(b+pow(dis[a]-'A'+1,a+1), a+1))
                    return 1;
                vis[i] = 0; 
        }
        return 0;
    } 
    int main(){
        while(~scanf("%d%s", &sum, str), sum != 0 && strcmp(str, "END") != 0){
            len = strlen(str);
            memset(vis, 0, sizeof(vis));
            sort(str, str+len);
            if(Dfs(0, 0))
                printf("%s
    ", dis);
            else
                printf("no solution
    ");
        }
        return 0;
    }
  • 相关阅读:
    inotify-java linux系统监听文件发生变化,实时通知java程序
    设置模式之单例模式(附上一个Objective-C编写的播放音乐的单例类)
    设计模式之观察者模式(关于OC中的KVOKVCNSNotification)
    设计模式之原型模式(深入理解OC中的NSCopying协议以及浅拷贝、深拷贝)
    设计模式之模板方法模式&&迪米特法则(代码Objective-C展示)
    iOS开发:深入理解GCD 第一篇
    设计模式之工厂方法模式(代码用Objective-C展示)
    iOS开发:一个高仿美团的团购ipad客户端的设计和实现(功能:根据拼音进行检索并展示数据,离线缓存团购数据,浏览记录与收藏记录的批量删除等)
    Xcode一些好用的插件,以及这些插件的管理器
    综合出现NSScanner: nil string argument libc++abi.dylib: terminat错误的解决方案
  • 原文地址:https://www.cnblogs.com/soTired/p/5017133.html
Copyright © 2011-2022 走看看