zoukankan      html  css  js  c++  java
  • 杭电1015



    Safecracker

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


    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
     



    //杭电1015
    #include <iostream>
    #include <math.h>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    char letters[13];
    char result[6];
    unsigned long target;
    
    bool cmp(const char &a,const char &b) {
        return (b-a)>=0?false:true;
    }  
    
    
    int main()
    {
        
    	while ((cin >> target >> letters) )
    	{
            if (target == 0 && !strcmp(letters, "END"))
                break;
            
    		int len = strlen(letters);
    		sort(letters, letters + len, cmp);
    		bool find = false;
            int V,W,X,Y,Z;
    		for (int v = 0 ; v < len ; ++ v)
            {
                V = letters[v] - 64;
    			for (int w = 0; w < len ; ++ w)
                {
                    if (w == v)continue;
                    W = letters[w] - 64;
    				for (int x = 0; x < len ; ++ x)
                    {
                        if (x == w || x == v)continue;
                        X = letters[x] - 64;
    					for (int y = 0; y < len  ; ++ y)
                        {
                            if (y == x || y == w || y == v)continue;
                            Y = letters[y] - 64;
    						for (int z = 0; z < len; ++z)
    						{
    							if (z == y || z == x || z == w|| z == v)
    								continue;
                                Z = letters[z] - 64;
    							unsigned long temp = V - W*W + X*X*X - Y*Y*Y*Y + Z*Z*Z*Z*Z;
    							if (target == temp)
    							{
    								result[0] = letters[v];
    								result[1] = letters[w];
    								result[2] = letters[x];
    								result[3] = letters[y];
    								result[4] = letters[z];
    								result[5] = '\0';
    								find = true;
                                    break;
    							}
    						}
                            if(find)break;
                        }
                        if (find)break;
                    }
                    if(find)break;
                }
                if (find)break;
            }
            
    		if (find)
    			cout << result[0] << result[1]<< result[2] << result[3]<<result[4]<<endl;
    		else
    			cout << "no solution" << endl;
            
    	}
    	return 0;
    }
    
    


  • 相关阅读:
    RTMP协议Web直播点播系统EasyDSS视频平台解决无法获取指定时间快照问题
    在线教育web无插件点播平台EasyDSS在上传部分点播文件出现无法观看问题如何修复?
    RTMP协议Web直播点播服务平台EasyDSS增加获取录像指定时间的m3u8播放地址
    RTMP协议视频平台EasyDSS编译过程中Go语言异步信息处理设计与实现
    在线课堂web无插件直播点播平台EasyDSS播放指定时间段的录像报404是什么原因?
    推流直播如何通过EasyDSS推流将内网EasyGBS视频流推到公网直播间进行直播?
    RTMP协议视频平台EasyDSS开发中如何通过Go语言 gorm 框架钩子函数精简代码?
    POJ1740 A New Stone Game 博弈论基础题 男人8题
    HDU1847 博弈论 水题
    POJ 2763 Housewife Wind LCA基础题
  • 原文地址:https://www.cnblogs.com/dancingrain/p/3405214.html
Copyright © 2011-2022 走看看