# Läxproblem: DP/greedy

Lös Kattisproblemen:
https://open.kattis.com/problems/minimumscalar
https://open.kattis.com/problems/bank
https://open.kattis.com/problems/trainsorting

Lös **minst ett** av:
https://open.kattis.com/problems/bond
https://open.kattis.com/problems/entertainmentbox

Och **minst ett** av:
https://open.kattis.com/problems/orders
https://open.kattis.com/problems/joggers
https://open.kattis.com/problems/ambush

Rekommenderad läsning
http://web.stanford.edu/class/cs97si/04-dynamic-programming.pdf
http://www.csc.kth.se/~jsannemo/slask/main.pdf kapitel 8 (greedy), 9 (DP)
Introdution to Algorithms, kapitel 15 (DP), 16 (greedy)
https://en.wikipedia.org/wiki/Zeckendorf's_theorem (mer komplicerat greedy-bevis)
https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/