zoukankan      html  css  js  c++  java
  • HDOJ1015(简单深搜)

    Safecracker

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


    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
     
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    const int MAXN=20;
    int target,len;
    char s[MAXN];
    int vis[MAXN];
    int buf[MAXN];
    bool comp(char ch1,char ch2)
    {
        return ch1 > ch2;
    }
    bool dfs(int dep)
    {
        if(dep==5)
        {
            long long sum=0;
            for(int i=0;i<dep;i++)
            {
                long long e=1;
                for(int j=0;j<=i;j++)
                {
                    e*=buf[i];
                }
                if(i%2==0)    sum+=e;
                else    sum-=e;
            }
            if(sum==(long long)target)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
        for(int i=0;i<len;i++)
        {
            if(!vis[i])
            {
                vis[i]=1;
                buf[dep]=s[i]-'A'+1;
                if(dfs(dep+1))
                {
                    return true;
                }
                vis[i]=0;
            }
        }
        return false;
    }
    int main()
    {
        while(scanf("%d%s",&target,s)!=EOF)
        {
            if(target==0&&strcmp(s,"END")==0)    break;
            memset(vis,0,sizeof(vis));
            len=strlen(s);
            sort(s,s+len,comp);
            if(dfs(0))
            {
                for(int i=0;i<4;i++)
                {
                    printf("%c",buf[i]+'A'-1);
                }
                printf("%c
    ",buf[4]+'A'-1);
            }
            else
            {
                printf("no solution
    ");
            }
        }
        return 0;
    }
  • 相关阅读:
    CharacterEncodingFilter详解及源码解析
    SPI 串行Flash闪存W25Q128FV 的使用(STM32F407)_硬件篇
    STM32 TFT LCD
    什么叫状态机:按键消抖实例
    STM32 ADC单通道采集 (STM32F103C8T6 ADC1的0通道 )
    STM32 PWM输出 (STM32F103C8T6 TIM2_CH2 )
    STM32 多通道ADC连续采集之数据到内存 DMA传输
    STM32 DAM之串口通讯
    STM32定时器之PWM 4路输出 TIM3、TIM14
    STM32定时器 TIM14之PWM 可调脉宽输出 呼吸灯
  • 原文地址:https://www.cnblogs.com/program-ccc/p/4689515.html
Copyright © 2011-2022 走看看