Jemary_的博客

ASome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer

传送门A/*题目大意：一个人去买C瓶可乐，每瓶八块，有1 5 10面值的硬币若干，求出最少投币数。售货机会尽可能的找更少的硬币个数(也就是投一个十块三个一块，会找一个五块= =)解题思路：dp[i][j][k]，ijk记录三个硬币状态，dp记录使用个数，递归加优化*/#include #include #include #include #include using

A - 最长递增子序列 POJ - 2533                                                  A numeric sequence of ai is ordered if a1 a2 aN. Let the subsequence of the given numeric sequence ( a1, a2, .

A - Oil Deposits HDU - 1241             The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region

A HDU - 2037   “今年暑假不AC？” “是的。” “那你干什么呢？” “看世界杯呀，笨蛋！” “@#$%^&*%...” 确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。 作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家

A - Bachgold ProblemBachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation