zoukankan      html  css  js  c++  java
  • Little Sub and Enigma

    Little Sub builds a naive Enigma machine of his own. It can only be used to encrypt/decrypt lower-case letters by giving each letter a unique corresponding lower-case letter. In order to ensure the accuracy, no contradiction or controversy is allowed in both the decryption and the encryption, which means all lower-case letters can only be decrypted/encrypted into a distinct lower-case letter.
    Now we give you a string and its encrypted version. Please calculate all existing corresponding relationship which can be observed or deducted through the given information.

    输入

    The first line contains a string S, indicating the original message.
    The second line contains a string T, indicating the encrypted version.
    The length of S and T will be the same and not exceed 1000000.

    输出

    we use a string like ’x->y’ to indicate that letter x will be encrypted to letter y.
    Please output all possible relationships in the given format in the alphabet order.
    However, if there exists any contradiction in the given information, please just output Impossible in one line.

    样例输入

    复制样例数据

    banana
    cdfdfd
    

    样例输出

    a->d
    b->c
    n->f
    

    ps:25组确定后,第26组也会确定。

    #include <iostream>
    #include <bits/stdc++.h>
    using namespace std;
    int a1[200];
    int a2[200];
    int main()
    {
        string s1,s2;
        cin>>s1>>s2;
        if(s1.length()!=s2.length()) {
            printf("Impossible
    ");
            return 0;
        }
        int cnt=0,t=0;
        for(int i=0;i<s1.length();i++){
            int x=s1[i];
            int y=s2[i];
            if(!a1[x]&&!a2[y]) {
                a1[x]=y;
                cnt++;
                a2[y]=1;
            }
            else if(a1[x]&&a1[x]==y) continue;
            else {
                t=1;
                break;
            }
        }
        if(t) printf("Impossible
    ");
        else {
            if(cnt==25){
                int p=-1,q=-1;
                for(int i='a';i<='z';i++){
                    if(!a1[i]) p=i;
                    if(!a2[i]) q=i;
                }
                for(int i='a';i<'z';i++){
                    if(i==p) printf("%c->%c
    ",i,q);
                    else printf("%c->%c
    ",i,a1[i]);
                }
                return 0;
            }
            for(int i='a';i<='z';i++){
                if(a1[i]) printf("%c->%c
    ",i,a1[i]);
            }
        }
        return 0;
    }
    
  • 相关阅读:
    设计模式之工厂模式大后期
    Net基础恶补
    TPL异步并行编程之回调
    Net线程安全集合
    【记录贴】树的深度最优路径分析 [ 未完全版 ] 【原】
    java生产环境增量发版陷阱【原】
    expdp和impdp导入导出用法【转】
    exp和imp导入导出时表空间问题【未完】
    linux xargs【转】
    windows cmd命令 批处理bat 导增量jar包【原】
  • 原文地址:https://www.cnblogs.com/skyleafcoder/p/12319501.html
Copyright © 2011-2022 走看看