皮皮虎

摘要： Super Jumping! Jumping! Jumping! Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. 阅读全文

摘要： Problem Description Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more diffi 阅读全文

摘要： 最短路算法简单模板 一.floyed算法 首先对于floyed算法来说就是最短路径的动态规划解法，时间复杂度为O（n^3） 适用于图中所有点与点之间的最短路径的算法，一般适用于点n较小的情况。 Floyed算法有三层循环，循环的层次先后顺序也是比较重要的，分别为k ，i，j；因为dis[k][i][ 阅读全文

摘要： Description A county consists of n cities (labeled 1, 2, …, n) connected by some bidirectional roads. Each road connects a pair of distinct cities. A 阅读全文

摘要： Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want 阅读全文

摘要： Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than o 阅读全文

摘要： Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one- 阅读全文

摘要： Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ 阅读全文

摘要： Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who t 阅读全文

摘要： Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to vis 阅读全文