摘要: 素数环,回溯法,DFS基础题。对于DFS偶还没接触过,看到一篇好的文章,分享下:http://yangjunke111.blog.163.com/blog/static/135279606201041312753102/ 额,直接看代码吧#include <iostream>using namespace std;int n,cas=1,visit[20],result[20]={0,1},p[]={0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,1,0};void DFS( 阅读全文
posted @ 2013-02-24 23:38 SF-_- 阅读(539) 评论(0) 推荐(0) 编辑