06 2018 档案

摘要：Yixght is a manager of the company called SzqNetwork(SN). Now she's very worried because she has just received a bad news which denote... 阅读全文

摘要：There are N cities in a country, and there is one and only one simple path between each pair of cities. A merchant has chosen some pat... 阅读全文

摘要：Pog and Szh are playing games. Firstly Pog draw a tree on the paper. Here we define 1 as the root of the tree.Then Szh choose some nod... 阅读全文

摘要：当我们想要知道从最快地从A走到B时，朴素的想法是找出任何一个点走任意步会到达的地方，但是这样太耗内存。但是实际上可以只记录走1,2,4,8,16步能到达的地方从A出发：若跳8个格子（超过B了，放弃） 若跳4个格子（超过B了，放弃） ... 阅读全文