包河区2023年小学组信息学竞赛试题 Vigenere密码（vignere)

题目描述 Description

父母使用vigenère 密码来加密自己的手机，现在请你来破解。在密码学中，我们称需要加密的信息为明文，用M表示；称加密后的信息为密文，用C表示；而密钥是一种参数，是将明文转换为密文或将密文转换为明文的算法中输入的数据，记为k。在Vigenère密码中，密钥k是一个字母串，k=k1,k2,…kn。当明文M=m1,m2,…mn时，得到的密文C=c1,c2,…cn，其中ci=mi®ki，运算®的规则如下表所示：

Vigenère 加密在操作时需要注意：

    1、®运算忽略参与运算的字母的大小写，并保持字母在明文M中的大小写形式；

    2、当明文M的长度大于密钥K的长度时，将密钥K重复使用。

例如，明文 M = Helloworld，密钥K=abc
密文C = Hfnlpyosnd

输入描述 Input Description

输入共2行。
第一行为一个字符串，表示密钥k，长度不超过100，其中仅包含大小写字母。

第二行为一个字符串，表示经加密后的密文，长度不超过1000，其中仅包含大小写字母。

输出描述 Output Description

一个字符串，表示输入密钥和密文所对应的明文。

样例输入 Sample Input

CompleteVictory Yvqgpxaimmklongnzfwpvxmniytm

样例输出 Sample Output

Wherethereisawillthereisaway

数据范围及提示 Data Size & Hint

对于100%的数据，输入的密钥的长度不超过100，输入的密文的长度不超过1000，且都仅包含英文字母。

分析

把图给存起来，对于第i个字符，找到以它为开头的一行中与明文一样的输出 。

代码

#include<iostream>
using namespace std;
string k,m,x;
int idx=-1;
char a[50][50]={
{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'},
{'b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a'},
{'c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b'},
{'d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c'},
{'e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d'},
{'f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e'},
{'g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f'},
{'h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g'},
{'i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h'},
{'j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i'},
{'k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j'},
{'l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k'},
{'m','n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l'},
{'n','o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m'},
{'o','p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n'},
{'p','q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o'},
{'q','r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p'},
{'r','s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q'},
{'s','t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r'},
{'t','u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s'},
{'u','v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t'},
{'v','w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u'},
{'w','x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v'},
{'x','y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w'},
{'y','z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x'},
{'z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y'}
};
int main(){
    //freopen("vignere.in","r",stdin);
    //freopen("vignere.out","w",stdout);
    getline(cin,k);
    getline(cin,m);
    x=m;
    for(int i=0;i<k.size();i++){
        if(k[i]>='A'&&k[i]<='Z')    k[i]+=32;
    }
    for(int i=0;i<m.size();i++){
        if(m[i]>='A'&&m[i]<='Z')    m[i]+=32;
    }
    for(int i=0;i<m.size();i++){
        idx++;
        if(idx==k.size())   idx=0;
        for(int j=0;j<=25;j++){
            if(a[k[idx]-'a'][j]==m[i]){
                if(x[i]>='A'&&x[i]<='Z'){
                    cout<<(char)(j+'A');
                }else{
                    cout<<(char)(j+'a');
                }
                break;
            }
        }
    }
    return 0;
}