What are your favourite knapsack problems? Please link them in the answer. I just learnt the algo and would like to get proficient in it. Thanks
this qn itself says it is knapsack problem, u can get ac in first attempt in this qn… easy one
nice problem of knapsack…
it really helped
Some of them below are good
https://codeforces.com/contest/364/problem/B
http://codeforces.com/problemset/problem/95/E
http://www.codeforces.com/problemset/problem/190/A
http://codeforces.com/problemset/problem/19/B
http://www.spoj.pl/problems/KNAPSACK/
http://code.google.com/codejam/contest/dashboard?c=90101#s=p2
http://community.topcoder.com/stat?c=problem_statement&pm=11511&rd=14545
http://pclub.in/index.php/wpc-archives/16-kodefest-solutions/86-problem-d
http://www.spoj.pl/problems/PIGBANK/
http://www.spoj.pl/problems/GNYR09F/
http://www.spoj.pl/problems/THREECOL/
http://www.spoj.pl/problems/SCUBADIV/
http://code.google.com/codejam/contest/dashboard?c=1128486
http://www.spoj.pl/problems/AE1B/
http://www.spoj.pl/problems/ARRANGE/
Will Add more to the List if come across some Knapsack problems
Nice Collection
perfect problem to start with knapsack thanq
nice one
what Knapsack itself. i have been looking around on the net, but could not understand the theory yet. i am a nwebie.
thnx
i think i found a helpful info here: http://www.programminglogic.com/knapsack-problem-dynamic-programming-algorithm/
This is a pretty good simple knapsack problem: http://www.codechef.com/problems/PPTEST/
Another slightly tougher knapsack problem: www.spoj.com/problems/BACKPACK/
Solve this http://www.spoj.com/problems/PARTY/
Good way to start DP and knapsack type problem
Are you sure each of the above problems is an application of knapsack? I have solved some of them and i don’t think so. For example-
- MIXTURES - Matrix Chain Multiplication
- AGGRCOW - Binary search
- STAMPS, BAISED - Adhoc
I don’t think MINUS on SPOJ is knapsack either.
Wow!! Instead of replying to our queries, you just edited your answer and made aur questions look stupid. Now what will you do if i say that the problem AE1B is also adhoc ?
really nice one
pale_rider plz look problem carefully then surely u will understand that MINUS on spoj is knapsack infinitum really nice collection