摘要：
题目链接: http://poj.org/problem?id=2533 Description A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric s 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1160 Problem Description FatMouse believes that the fatter a mouse is, the faster it runs. To disprove 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1260 Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. How 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1074 Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot o 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1069 Problem Description A group of researchers are designing an experiment to test the IQ of a monkey 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1087 Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is v 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=3746 Problem Description CC always becomes very depressed at the end of this month, he has checked his 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2087 Problem Description 一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？ Input 阅读全文
摘要：
题目链接: http://poj.org/problem?id=1200 Description Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could 阅读全文
摘要：
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2159 Problem Description 最 近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完 这最 阅读全文