Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW)
OpenStudy (anonymous):

I'm going CRAZY here. Can someone please help me on ps2A! This is what I have. I know it is really ugly, but I have been all over the place. http://dpaste.com/hold/603902/ Any help would greatly be appreciated. Thanks

OpenStudy (anonymous):

could you let us know more about your intentions are. I've run your script but I can't quite figure out what you are meaning for it to do precisely, loop by loop. Also, why are you doing it as a function exactly? I just completed this assignment earlier in the week, and I could show you my code if it would help.

OpenStudy (anonymous):

What I am trying to do in the loops try every possible scenario of 6, 9, and 12 combinations between the numbers 1 and 150. The combos that do not add up to one of those numbers are put in a list. The last number added to the list should be the highest number that cannot be bought in the exact quantity. I know the end of my code doesn't make sense, but I was trying everything and that's where I had enough and left it at is. That would be great if you can post your answer and then I can see how you approached the problem. Thanks for the help.

OpenStudy (anonymous):

Does this seem right? http://dpaste.com/604150/

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!