HDOJ 2553 N皇后问题
摘要:
回溯,看了lrj的白书后写的;一提交,TLE。# include <stdio.h># define MAXN 15int n, ans;char vis[3][MAXN*2+1];void search(int cur);int main(){ while (~scanf("%d", &n)) { if (!n) break; ans = 0; memset(vis, 0, sizeof(vis)); search(0); printf("%d\n", ans)... 阅读全文
posted @ 2012-04-12 10:11 getgoing 阅读(254) 评论(0) 推荐(0) 编辑