2018年10月5日
HDU - 5952 Counting Cliques(dfs搜索)
摘要： 题目： A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task i 阅读全文
posted @ 2018-10-05 19:10 sykline 阅读(165) 评论(0) 推荐(0) 编辑