枚举.cpp

八皇后问题的最好解法,利用回朔法的典型例子,还有其他几个好程序

#include <iostream.h>
#include <iomanip.h>
void main()
{
	enum color_set{red,yellow,blue,white,black};
	color_set color;
	int i,j,k,counter=0,loop;
	for(i=red;i<=black;i++)
		for(j=red;j<=black;j++)
			for(k=red;k<=black;k++)
				if(k!=i&&k!=j&&i!=j)
				{
					counter++;
					for(loop=1;loop<=3;loop++)
					{
						switch(loop)
						{
						case 1:color=(color_set)i;break;
						case 2:color=(color_set)j;break;
						case 3:color=(color_set)k;break;
						}
						switch(color)
						{
						case red:cout<<setw(15)<<"red";break;
						case yellow:cout<<setw(15)<<"yellow";break;
						case blue:cout<<setw(15)<<"blue";break;
						case white:cout<<setw(15)<<"white";break;
						case black:cout<<setw(15)<<"black";break;
						}
					}
					cout<<endl;

				}
				cout<<"共有"<<counter<<"种排列"<<endl;

}