HNU2019暑期训练赛之2 K. Kleptography

Problem Description

John likes simple ciphers. He had been using the “Caesar” cipher to encrypt his diary until recently, when he learned a hard lesson about its strength by catching his sister Mary browsing through the diary without any problems.

Rapidly searching for an alternative, John found a solution: the famous “Autokey” cipher. He uses a version that takes the 26 lower-case letters ‘a’–‘z’ and internally translates them in alphabetical order to the numbers 0 to 25.

The encryption key k begins with a secret prefix of n letters. Each of the remaining letters of the key is copied from the letters of the plaintext $a$, so that kn+i=aik_{n+i} = a_ikn+i​=ai​ for i ≥ 1. Encryption of the plaintext a to the ciphertext b follows the formula bi=ai+kib_i = a_i + k_ibi​=ai​+ki​ mod 26.

Mary is not easily discouraged. She was able to get a peek at the last n letters John typed into his diary on the family computer before he noticed her, quickly encrypted the text document with a click, and left. This could be her chance.

Input

The input consists of:
• One line with two integers $n$ and $m(1\le n\le 30,n+1\le m\le 100)$, where $n$ is the length of the keyword as well as the number of letters Mary saw, and m is the length of the text.
• One line with $n$ lower-case letters, the last $n$ letters of the plaintext.
• One line with $m$ lower-case letters, the whole ciphertext.

Output

Output the plaintext of John’s diary.

Sample Input

5 16
again
pirpumsemoystoal

Sample Output

marywasnosyagain

Sample Input2

1 12
d
fzvfkdocukfu

Sample Output2

shortkeyword

AC Code

#include <iostream>
#include<cstdio>
using namespace std;
char key[150];
char b[150];
char a[150];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int n, m;
    cin >> n >> m;
    cin >> (key+m-n);
    char tempKey[100];
    cin >> b;
    for(int j = m-1; j>=n; --j){
        a[j] = b[j] - key[j] +'a';
        if (a[j] < 'a')
            a[j] += 26;
        key[j-n] = a[j];
    }
    cout <<(key)<<endl;
    cout << a;
    return 0;
}