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

I've just finished problem set 2 - question 4: can someone check it for me...? somehow it gets so long and its kinda weird...i just learned for 2 days so dont know many codes...

OpenStudy (anonymous):

OpenStudy (anonymous):

I just finished this assignment myself, so I may not have enough experience to help you fully. What are your packet sizes? From looking at your code, it looks like they are 10, 20, 50. Your code says that the largest quantity you can't buy exactly is 53. But you can't buy 54 nuggets, can you?

OpenStudy (anonymous):

oh actually it was actually 7, 10, 20 haha the 50 is the size of tested x because i break the problem into bracket [0,50] [51,100] and [101,150] to avoid testing too many cases so i set x = 50 at first to test whether 50 is larger than the largest quantity or not

OpenStudy (anonymous):

Oh, my mistake. Your code seems to work when I use it, but I can't really help you because you use functions, which I am just now learning about and are not necessary for solving this problem.

OpenStudy (anonymous):

oh thanks anyway (well did i use any function...? lol...) im at the beginning too so yea...

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!