Affine Key Finder, C++ (vc++)

Language: Layout:

//Microsoft (R) C/C++ Optimizing Compiler Version 19.00.23506 for x64

#include <iostream>
#include <vector>

using std::cout;
using std::endl;
using std::vector;

/*
    The purpose for this struct is to hold my possible alpha and beta
    values that the program found to fit the conversions. The struct
    is stored into a vector that holds all possible values.
*/
struct AB
{
    int alpha;
    int beta;
};

/*
    My main function that computes all 312 conversions from plaintext
    to ciphertext. Using the plain -> cipher conversion from HW1.6, the
    program will find the possible combinations of alpha and beta values
    from samples of that conversion.
*/
void main()
{
    // I begin by storing all possible values of alpha and beta into two
    // separate arrays. I also initialize my storage containers.
    int alphArray[12] = {1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25};
    int betaArray[26];
    vector<AB> possibleAB;
    AB temp;
    
    // I use a loop to store the 26 values of beta instead of doing the same
    // process as the alphArray.
    for (int i = 1; i <= 26; i++)
    {
        betaArray[i-1] = i;
    }
    
    // This nested for loop is the main component that finds the possible
    // conversions using two arbitrarily chosen conversions from HW1.6 as
    // a key. In this case, I took the conversions R -> D (ie 17 -> 3) and
    // P -> Z (ie 15 ->25).
    for (int i = 0; i < 12; i++)
    {
        for (int j = 0; j < 26; j++)
        {   
            if ( ((alphArray[i]*17) + betaArray[j]) % 26 == 3 && ((alphArray[i]*15) + betaArray[j]) % 26 == 25)
            {
                temp.alpha = alphArray[i];
                temp.beta = betaArray[j];
                
                possibleAB.push_back(temp);
            }
        }
    }
    
    // Luckily from these two conversions, there was only one outcome. If
    // there had been more, I would have added more conversions from the
    // example to weed out more possibilities.
    
    // This loop is just to see what were the values that were found to
    // satisfy the conversion.
    cout << "Possible combinations: " << possibleAB.size() << endl;
    for (int i = 0; i < possibleAB.size(); i++)
    {
        cout << "My alpha value: " << possibleAB[i].alpha << endl;
        cout << "My beta value: " << possibleAB[i].beta << endl;
    }
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1,79 sec, absolute running time: 0,21 sec, absolute service time: 2,02 sec