⁄(⁄ ⁄•⁄ω⁄•⁄ ⁄)⁄. 菜鸟不吃草！

HDU 1372A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a c

原题链接Codeforces 782C Andryusha and Colored Balloons(BFS)Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.The park consi

图论基础算法NO.1 Floyd（多源最短路） 数据结构：邻接矩阵 特点：数据规模不能大（<1000）复杂度O(n^3) 五行代码：//Floydvoid floyd(){ for(int k=0;k<n;k++){ for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ dp[

Highway ProjectEdward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the capital as fast as possible. Thus, he proposed the highway