摘要：
//简单搜索，只要走遍所有可达的路径BFS版:#include "iostream"#include "cstdio"#include "memory.h"#include "queue"using namespace std;const int MAX = 22;const int dx[] = ... 阅读全文
摘要：
//经典搜索题 #include #include using namespace std;int primelist[38] = {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};//素数表，... 阅读全文