I'm struggling to work out what I am doing wrong with my current project. Firstly, my aim is to try and program a bruteforce attack using all the letters in the alphabet and numbers from 0-9.

I stumbled on string permutation which allows me to generate all combinations possible from characters in a string. e.g `abc` would give me `abc`, `acb`, `bca`.. etc. I have a problem though as it displays a line of 36 characters. I want it to generate all combinations from 2 character/number long combinations such as `aa` `a1` `a2` all the way to 15 character and number combinations. My code is below which outputs all combinations possible in a line of 36 characters. Also to note, I tried re-sizing the string but it only displayed the first 5 characters and not all of them.

```
class Attack
{
public:

    string combinations;
};

void BruteforceAtt()
{
    Attack bruteforce;

    bruteforce.combinations = "abcdefghijklmnopqrstuvwxyz123456789";

    cout<<"BruteForce Attack is a go..."<<endl;
    cout<<"Searching..."<<endl;
    cout<<""<<endl;

    do
    {
        bruteforce.combinations.resize(5);
        cout<<bruteforce.combinations<<endl;

    } while (next_permutation(bruteforce.combinations.begin(), bruteforce.combinations.end()));

    system("Pause");
};

```