/*
// http://www.dreamincode.net/forums/topic/206682-a-program-to-solve-this-i-tried-this-code/
Input:
d
Output:
d 1
da 2
daa 3
dab 4
dac 5
dad 6
dae 7
daf 8
dag 9
dah 10
dai 11
daj 12
dak 13
dal 14
dam 15
dan 16
dao 17
dap 18
daq 19
dar 20
das 21
dat 22
dau 23
dav 24
daw 25
dax 26
day 27
daz 28
dba 29
dbb 30
dbc 31
dbd 32
.
.
dzz
*/
#include <iostream>
using namespace std;
int main()
{
char outputstring[3];
int counter=1;
cout << "Input: " ;
cin>>outputstring[0]; //d
cout << outputstring << \'\\t\' << counter << endl;//d 1
outputstring[1]=\'a\'; counter++;
cout << outputstring << \'\\t\' << counter << endl;//da 2
while (1)
{
outputstring[2]=\'a\';
cout << outputstring << \'\\t\' << counter << endl;//daa 3
while (1)
{
outputstring[2]++; counter++;
cout << outputstring << \'\\t\' << counter << endl;
if(outputstring[2]==\'z\')
break;
}
outputstring[1]++; counter++;
if (outputstring[2]==\'z\'&&outputstring[1]==\'z\')
{
cout << outputstring << \'\\t\' << counter << endl;
break;
}
}
cin.ignore(110,\'\\n\');
cin.get();
return 0;
}