In Problem Set 8 problem number 4, I can get the maximum value that can be obtained but can't get a map of the items .

Question

anonymous · Answer

You should have three dictionares (in my code Inamed them path1,path2 and path) path1you will save the items of the "don't take", path2 you will save the items of "take".Then you compare them, the best one you equalize to path

anonymous · Answer

By the way, I had a really  hard time with this problem :D

anonymous · Answer

well , Are you sure? because I tried this and it didn't work . I mean both dictionaries will include items that shouldn't be there :D

anonymous · Answer

Can I see your code plz :D ?

anonymous · Answer

If you don't understand somethig, fell free to ask (I'm saying that because I didn't put comments on the code, sorry about that) http://codepad.org/IbYI0QjA