C / C++ / MFC

struct TChar
{
  unsigned char Pixels[10][45];
  unsigned char RTop, Width, Height;
  TWideText Text;
  unsigned char Style;
  bool deleted;
};

struct WideText
{
  TCHAR[20] Text;
  Byte Len;
};

<br />
#include <iostream><br />
#include <iomanip><br />
using namespace std;<br />
<br />
unsigned long factorial( unsigned long ); // function prototype<br />
//-------------------------------------------------------------------------<br />
int count = 0;<br />
<br />
int main()<br />
{  <br />
   // Loop 2 times. During each iteration, calculate factorial( i ) and display result.<br />
   for ( int i = 0; i <= 2; i++ )<br />
   {<br />
	  cout << "\n i = " << i << endl;<br />
	  cout << endl << setw( 2 ) << i << "! = " << factorial( i ) << endl;<br />
	  cout << endl << "--------------------------------------------" << endl;<br />
   }<br />
   return 0;  // indicates successful termination<br />
<br />
} // end main<br />
//-------------------------------------------------------------------------<br />
// recursive definition of function factorial<br />
unsigned long factorial( unsigned long number )<br />
{  <br />
   count++;<br />
   cout << endl << "factorial was invoked for the " << count << " time "<br />
        << "   number = " << number << endl;<br />
<br />
   // base case<br />
   if ( number <= 1 )  <br />
   {<br />
	  cout << endl << "number <= 1" << endl;<br />
      return 1;<br />
   }<br />
   // recursive step<br />
   else  <br />
   {<br />
	  cout << endl << "number = " << number <br />
		   << "    factorial(number - 1) = " << factorial(number - 1) <br />
		   << "     " <br />
		   << number  << " * " << factorial( number - 1 ) << " = " <br />
		   << number * factorial( number - 1 ) << endl;    <br />
		         <br />
      return number * factorial( number - 1 );<br />
   }<br />
} // end function factorial<br />
//-------------------------------------------------------------------------<br />

<br />
<br />
 i = 0<br />
<br />
factorial was invoked for the 1 time    number = 0<br />
<br />
number <= 1<br />
<br />
 0! = 1<br />
<br />
--------------------------------------------<br />
<br />
 i = 1<br />
<br />
factorial was invoked for the 2 time    number = 1<br />
<br />
number <= 1<br />
<br />
 1! = 1<br />
<br />
--------------------------------------------<br />
<br />
 i = 2<br />
<br />
factorial was invoked for the 3 time    number = 2<br />
<br />
factorial was invoked for the 4 time    number = 1<br />
<br />
number <= 1<br />
<br />
factorial was invoked for the 5 time    number = 1<br />
<br />
number <= 1<br />
<br />
factorial was invoked for the 6 time    number = 1<br />
<br />
number <= 1<br />
<br />
number = 2    factorial(number - 1) = 1     2 * 1 = 2<br />
<br />
factorial was invoked for the 7 time    number = 1<br />
<br />
number <= 1<br />
<br />
 2! = 2<br />
<br />
--------------------------------------------<br />
Press any key to continue<br />
*/<br />

<br />
 i = 2<br />
<br />
factorial was invoked for the 3 time    number = 2<br />
<br />
factorial was invoked for the 4 time    number = 1<br />
<br />
number <= 1<br />
<br />
factorial was invoked for the 5 time    number = 1<br />
<br />
number <= 1<br />
<br />
factorial was invoked for the 6 time    number = 1<br />
<br />
number <= 1<br />
<br />
number = 2    factorial(number - 1) = 1     2 * 1 = 2<br />
<br />
factorial was invoked for the 7 time    number = 1<br />
<br />
number <= 1<br />
<br />
 2! = 2<br />

"The greatest good you can do for another is not just to share your riches but to reveal to him his own." - Benjamin Disraeli

<br />
#include <iostream><br />
<br />
using namespace std;<br />
<br />
<br />
const int BOARD_SIZE = 8;<br />
<br />
// function prototypes<br />
void fillBoard( int [], int, int );<br />
bool noConflict( int [], int, int );<br />
void printBoard( int [], int );<br />
<br />
//--------------------------------------------------------------<br />
<br />
// main method<br />
int main()<br />
{<br />
	int chessboard[ BOARD_SIZE ];				// represents a chessboard with 8 rows (0-7)<br />
	int column = 0;				<br />
	int count = 0;						// keeps track of the count<br />
<br />
	fillBoard( chessboard, column, count );	// invokes fillBoard function to start filling the chessboard<br />
<br />
	return 0;	// indicates sucessful termination<br />
} // end main method<br />
<br />
//--------------------------------------------------------------<br />
<br />
// fillBoard method<br />
void fillBoard( int board[ BOARD_SIZE ], int c, int cnt )<br />
{<br />
	for( int r = 0; r <= 7; r ++ )			// for every row on the board<br />
	{<br />
		board[ c ] = r;						// assign the value of row to the column<br />
	<br />
<br />
		if( noConflict( board, r, c ) )		// if there is not a conflicting queen<br />
		{<br />
			if( c == 7 )					// if it is the last column<br />
			{<br />
				printBoard( board, cnt);	// output the board<br />
			}<br />
<br />
			else				<br />
			{<br />
				fillBoard( board, c + 1, cnt );	// else recursively invoke fillBoard for the next column<br />
			}<br />
		}<br />
	}<br />
} // end fillBoard method<br />
<br />
//--------------------------------------------------------------<br />
<br />
// noConflict method<br />
bool noConflict( int board[ BOARD_SIZE ], int r, int c )<br />
{<br />
	for( int col = c - 1; col >= 0; col-- )		// for each column on the board<br />
	{<br />
		if( board[ col ] == r				// checks horizontally to the left<br />
		 || board[ col ] == r + c - col		// checks diagonally moving down and to the left<br />
		 || board[ col ] == r + col - c )	// checks diagonally moving up and to the left<br />
		{<br />
			return false;	// there is a conflict<br />
		}<br />
		else<br />
		{<br />
			return true;	// there is not a conflict<br />
		}<br />
	}<br />
	return true;			// there is not a conflict<br />
} // end noConflict method<br />
<br />
//-------------------------------------------------------------<br />
<br />
// printBoard method<br />
void printBoard( int board [ BOARD_SIZE ], int cnt )<br />
{<br />
	cout << "Count = " << ++cnt << endl;	// output the count<br />
<br />
	for( int r = 0; r <= 7; r++ )			// for each row on the board<br />
	{<br />
		for( int c = 0; c <= 7; c++ )		// for each column on the board<br />
		{<br />
			if( board[ c ] == r )			// if the value of the column index is equal to the value of the row<br />
			{	<br />
				cout << "Q ";				// place a queen on that position<br />
			}<br />
<br />
			else<br />
			{<br />
				cout << "- ";				// else place a "dash" for an empty square on the board<br />
			}<br />
		}<br />
		cout << endl;<br />
	}<br />
	cout << endl;<br />
} // end printBoard method<br />
<br />
//-------------------------------------------------------------<br />