Przejdź do treści

Szyfr Beauforta

🔗 Opis problemu

Implementacja

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <iostream>

using namespace std;

string encode(string message, string key) {
    string encoded;
    int letter, keyIndex, k;
    letter = keyIndex = k = 0;

    for(char character : message) {
        k = 26 - ((int)character - (int)'a') + ((int)key[keyIndex] - (int)'a');
        k %= 26;
        letter = (int)'a' + k;

        if (letter > (int)'z') {
            letter = (int)'a' + letter - (int)'z';
        }

        encoded += (char)letter;
        keyIndex++;
        keyIndex %= key.size();
    }

    return encoded;
}

int main() {
    string message = "computerscience";
    string key = "cat";

    string encoded = encode(message, key);
    string decoded = encode(encoded, key);

    cout << "Encoded: " << encoded << endl;
    cout << "Decoded: " << decoded << endl;

    return 0;
}