Here's a simple programming problem for you to solve

[ErGingerbreadMandude]

Code:

// *********************Pool's Homework****************

#include <iostream>
#include <string>
#include <cmath>

using namespace std;

int main()
{
    //initialize variables
    string str;
    int integ, len, iter, count;
    
    //get the string and the length of output
    cout << "Input the string: " << endl;
    cin >> str;
    cout << "Input an integer: " << endl;
    cin >> integ;
    
    iter = 1; //iterator for exponent
    count = 0; //iterator for number of combinations
    len = str.length(); // how many letters
    const int COMB = pow(len, integ); //number of combinations
    string solutions[COMB]; //an array of strings to concatenate the solutions into

    for (int i = 0; i < integ; i++)
    {    
        while (count <= COMB-1)
        {
            for(int j = 0; j < len; j++) //ab
            {
                for(int k = 0; k < pow(len,(integ-iter)); k++)
                {
                    solutions[count] += str[j];
                    count++;
                }
            }
            
            
        }
        iter++;
        count = 0;
    }


    //print solutions
    cout << endl << endl << "There are " << COMB << " string combinations." << endl;
    cout << "String Combinations:" << endl;
    for (int i = 0; i < COMB; i++)
        cout << solutions[i] << endl;
    
    return 0;
}

You're welcome. You can PayPal me the $2k we agreed upon.

http://cpp.sh/2vh7d

I give thumbs down for SC.
My input: AB
My input: 2
Output:
AA
BB
AB
AB