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

http://codepad.org/NvbpD1NQ - problem set 3 diophantine.

OpenStudy (anonymous):

cool - here is a variant on your theme http://codepad.org/ZfUz4XRH

OpenStudy (anonymous):

Problem Set 2, Problem 1 to find nugget amounts for a value http://dpaste.com/hold/667918/

OpenStudy (anonymous):

btw..I modified my code thanks to Jwalker. I was doing extra math to ultimately get the formula =|

OpenStudy (anonymous):

Problem Set 2, Problem 1 to find maximum amount that cannot be bought in exact quantity http://dpaste.com/hold/667935/

OpenStudy (anonymous):

yeay

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!