/*
	Copyright 2005(c) Ian Treyball
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

	This program is provided "as is".
	The author takes no responsibility for anything done with it.
	_caution_ If the program recurses too deeply you can have a stack overflow.
*/
#include <stdio.h>
#include <math.h>
#include <time.h>

static void incr(const unsigned short int pos);
static const char set[] = {
	'a', 'b', 'c', 'd', 'e', 'f',
	'g', 'h', 'i', 'j', 'k', 'l',
	'm', 'n', 'o', 'p', 'q', 'r',
	's', 't', 'u', 'v', 'w', 'x',
	'y', 'z', '$', '!', '%', '*'
};
static char gss[3];
static unsigned long int cnt = 0;
static FILE *rslts;

int main(int argc, char **argv) {
	memset(&gss, '\0', sizeof(gss));
	rslts = fopen("results.txt", "w");
	const unsigned int pssbl = pow(sizeof(set), sizeof(gss));
	while(cnt < pssbl)
		incr(0);
	if(fclose(rslts) != 0) {
		fprintf(stderr, "%s", "error closing file");
		return -1;
	}
	printf("%s completed successfully\n", argv[0]);
	return 0;
}

static void incr(const unsigned short int pos) {
	cnt++;
	if(gss[pos] != '\0') {
	    static unsigned short int n;
		for(n = 0; n < sizeof(set); ++n) {
			if(gss[pos] == set[n]) {
				gss[pos] = set[n + 1];
				fputs(gss, rslts);
				fputc('\n', rslts);
				break;
			}
		}
		static unsigned short int i;
		for(i = 0; i < sizeof(gss); ++i) {
			if(gss[i] != set[sizeof(set) - 1]) {
				incr(i);
				break;
			} else {
				gss[i] = set[0];
			}
		}
	} else {
		gss[pos] = set[0];
		fputs(gss, rslts);
		fputc('\n', rslts);
	}
	return;
}

#if 0 /* in case someone actually tries to compile this */

#if 0 /* in case someone actually tries to compile this */

#if 0 /* in case someone actually tries to compile this */

/*
	Copyright 2005(c) Ian Treyball
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

	This program is provided "as is".
	The author takes no responsibility for anything done with it.
	_caution_ If the program recurses too deeply you can have a stack overflow.
*/
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string.h>

static void incr(const unsigned short int pos);
static const char set[] = {
	'a', 'b', 'c', 'd', 'e', 'f',
	'g', 'h', 'i', 'j', 'k', 'l',
	'm', 'n', 'o', 'p', 'q', 'r',
	's', 't', 'u', 'v', 'w', 'x',
	'y', 'z'
};
static char gss[4]; // for longer words, change the number here
static unsigned long int cnt = 0;
static unsigned int i = 0, n = 0;
static FILE *rslts;

int main(int argc, char **argv) {
	memset(&gss, '\0', sizeof(gss));
	rslts = fopen("results.txt", "w");
	// this seems reasonable for computing an okay size buffer.
	const size_t BUF_SIZE = sizeof(gss)/2 > 1?1024 * (sizeof(gss)/2) : 2048;
	char *const buf = (char *)malloc(BUF_SIZE);
	setvbuf(rslts, buf, _IOFBF, BUF_SIZE);
	// thanks to DaWei for bringing this former uncasted call to my attention.
	const unsigned int pssbl = (unsigned int)pow(sizeof(set), sizeof(gss));
	while(cnt < pssbl) {
		incr(0);
	}
	// responsible for flushing rslts, too
	if(fclose(rslts) != 0) {
		fprintf(stderr, "%s", "error closing file");
		return -1;
	}
	free(buf);
	printf("%s was successful\n", argv[0]);
	return 0;
}
/*
 * The heart of this program. Each call to this produces
 * the next value assigned to gss[] and writes it out to rslts.
 */
static void incr(const unsigned short int pos) {
	cnt++;
	if(gss[pos] != '\0') {
		for(n = 0; n < sizeof(set); ++n) {
			if(gss[pos] == set[n]) {
				gss[pos] = set[n + 1];
				fputs(gss, rslts);
				fputc('\n', rslts);
				break;
			}
		}
		for(i = 0; i < sizeof(gss); ++i) {
			if(gss[i] != set[sizeof(set) - 1]) {
				incr(i);
				break;
			} else {
				gss[i] = set[0];
			}
		}
	} else {
		gss[pos] = set[0];
		fputs(gss, rslts);
		fputc('\n', rslts);
	}
	return;
}

#if 0 /* in case someone actually tries to compile this */