dsa

#include <iostream>

using namespace std;

int index = 1;
int* primesArray;
const int sizeOfArray = 26;

void Init()
{
    primesArray = new int[sizeOfArray] {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
}

void Print()
{
    for (int i = 0; i < sizeOfArray; i++)
    {
        cout << primesArray[i] << " ";
    }
    cout << endl;
}

bool CheckForPrimes(int value)
{
    for (int i = 0; i < sizeOfArray; i++)
    {
        if (primesArray[i] == value)
        {
            return true;
        }
    }
    return false;
}


void DeconstructionToPrimes(int inputA)
{
    if (CheckForPrimes(inputA))
    {
        cout << inputA << "";
        return;
    }

    int temp = inputA;
    for (int i = 0; i < sizeOfArray; i++)
    {
        if (temp % primesArray[i] == 0 && temp / primesArray[i] >= 1)
        {
            int tempB = temp / primesArray[i];

            cout << primesArray[i] << "*";
            DeconstructionToPrimes(tempB);
            //cout << primesArray[i] << "+";

            temp = temp % primesArray[i];
        }
    }
}

int main()
{
    Init();
    Print();

    cout << "Deconstruction of " << 162 << ": ";
    DeconstructionToPrimes(162);

    //12 = 2 . 6 = 2 . 2 . 3
    //20 = 2 . 10 = 2 . 2 . 5
}