摘要:
//八皇后问题#include#includeint queenPlaces[92][8];int count=0;int board[8][8];void putQueen(int ithQueen);int main(){ int n,i,j; for(i=0;i<8;i++) { for... 阅读全文
摘要:
//红与黑#includeint W,H;char z[21][21];int f(int x,int y){ if(x=W||y=H) return 0; if(z[x][y]=='#') return 0; else{ z[x][y]='#'; return 1+f(x-1,y)+f... 阅读全文