摘要：
题目链接：http://poj.org/problem?id=3268 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow 阅读全文
摘要：
题目链接：http://poj.org/problem?id=1797 Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand busin 阅读全文
摘要：
题目链接：http://poj.org/problem?id=2253 Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitti 阅读全文
摘要：
题目链接: http://poj.org/problem?id=2387 Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2059 Problem Description 据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼，终于练成了绝 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1078 Problem Description FatMouse has stored some cheese in a city. The city can be considered as a sq 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2859 Problem Description Today is army day, but the servicemen are busy with the phalanx for the celeb 阅读全文
摘要：
题目链接: http://poj.org/problem?id=3616 Description Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she 阅读全文
摘要：
题目链接: http://poj.org/problem?id=3186 Description FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts o 阅读全文
摘要：
题目链接: http://acm.hust.edu.cn/vjudge/contest/view.action?cid=68966#problem/L Description A subsequence of a given sequence is the given sequence with s 阅读全文