Algobird

最大报销额Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。 Input测试输入包含若干测试用例。每个测试用例的第1行包含

题目链接：http://codeforces.com/contest/546/problem/DTwo soldiers are playing a game. At the beginning first of them chooses a positive integern and gives it to the second soldier. Then the secon

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1085给定1，2，5枚硬币个数，问最少不能凑到多少钱。先想到的是背包的解法。多重背包：#include using namespace std;int dp[8005];int value[4] = {1, 2, 5};int num[4];int cnt[8005];int

DescriptionFarmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e

DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work

DescriptionYou have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is on CDs. You need to have it on tapes so the problem to solve is: you have a tapeN minu

DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrang

Description电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2363 Accepted: 978DescriptionEmma and Eric are moving to their new house they bought after returning from their

Piggy-Bank                                                   Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)                                                    

CoinsDescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watc

DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't matter,

DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …

今天上算法分析与设计课时，提到整数划分问题，但是因为之前没有很好地理解这一系列的问题。当被老师问到你们做算法的应该会这个问题吧，我当时也不太记得，但是只能硬头皮试着去写了下，用的是brute force，老师果断说我的方法跑不出正确的解，但是课堂上我也没有去解释了。课后自己验证了一下，没有问题，但是看了一下更好的动态规划的解法，顺便把几种整数划分的类型都理解清楚。原题：一个整数划分为多