Â¥Ö÷

±éÀú¹ú¼ÊÏóÆåÆåÅÌ Çó´ÓÆåÅ̵Ä×óϽǵ½ÓÒÉϽǵÄÎÞÑ­»·Â·¾¶µÄ×ÜÊý #include"stdio.h" #define N 8 //ÒòΪËã³öÀ´µÄÊý¾ÝÌ«´ó£¬ËùÒÔÒªËãºÜ¾Ã£¬¿ÉÒԸıäNµÄÖµ½øÐвâÊÔ¡£ #include"iostream.h" //´ËËã·¨²ÉÓûØËÝ·¨ enum bin{fal,tr}; int top=0; long int num=0; int row[]={-1,-2,-2,-1,1,2,2,1}; int col[]={-2,-1,1,2,2,1,-1,-2}; bin mark[N][N]; struct stack { int x,y; int dir;}board[N*N]; void push(stack it) { board[top].x=it.x; board[top].y=it.y; board[top].dir=it.dir; mark[board[top].x][board[top].y]=tr; top++; } stack pop() { --top; mark[board[top].x][board[top].y]=fal; board[top].dir++; return board[top]; } bin empty() { if(top==0) return tr; else return fal; } void main() { stack temp={N-1,N-1,-1}; push(temp); while(!empty()) { int g,h; temp=pop(); int i=temp.x; int j=temp.y; int dir=temp.dir; while(dir<8) { g=i+row[dir]; h=j+col[dir]; if((g<0)||(h<0)||(g>=N)||(h>=N)||mark[g][h]) dir++; else { if(g==0&&h==0) {num++;dir++;} else { temp.x=i; temp.y=j; temp.dir=dir; push(temp); i=g; j=h; dir=0; }//else }//else }//while }//while cout<<"the total number is:"<<num; getchar(); }//main

----------------------------------------------
Êý¾ÝÍÚ¾òÇàÄê http://blogger.org.cn/blog/blog.asp?name=DMman
¼Í¼Ƭ֮¼Ò £¨ºÜ¶à¼Í¼ƬÏÂÔØ£©http://www.jlpzj.com/?fromuid=137653