wzh190015的博客

八皇后问题的求解代码和全部解

源.cpp//数独计算器//源.cpp//Author:wzh190015//Date:2015/12/28#include<iostream>#include<fstream>#include<array>#include<set>#include"cell.h"using namespace std;array<array<cell , 9> , 9> sud;bool chan

用广度优先遍历求有向带权图的最短路径

用Huffman树实现文本的压缩

import urllib.requestimport urllib.parsefrom bs4 import BeautifulSoupimport repattern=re.compile(r'/view/\d+.html?')ulrs_ed=set([])queue=[]MAX=100def spider(url): url_full='http://baike.baidu