Question

Problem set 2 #4

Answer 1

http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00-introduction-to-computer-science-and-programming-fall-2008/assignments/pset2.pdf

i'm getting nothing....

Answer 2

Do you still have the fixed script from pset2c that I helped you make ?

Answer 3

alright i think i was overthinking #4 and trying to completely rewrite...this one yields the right answers and the values for the packages can be easily changed.

but im wondering, i know it works, but is it what the problem set is asking for?

Answer 4

Your first answer is right but when it says the largest number that cannot be bought is 50 which is wrong. Also what I did on mine is put a raw_input so that I don't have to change the code when I want to change the sizes.

Answer 5

remember in your pset2c code your while loop was while count<5.( not 6) so therefor your while loop is while count<x-1.

Answer 6

does that work in all scenarios? because the point is to have 6 (or whatever the smallest package size is) consecutive integers

Answer 7

heres one that works, its just a little different because the final result is n-(x+1)

Answer 8

by doing while count<x-1 it cancels out th n-(x+1)

Answer 9

but say theres a sequence that reaches a count of x-1 but then doesnt make it all the way to x

Answer 10

it would still go through

Answer 11

and you don't want it to in that scenario

Answer 12

it happens to work in the 6,9,20 scenario because the first sequence of 5 ALSO happens to be the first sequence of 6
but say it wasnt?

Answer 13

I don't get what your saying because if the count<1 less than x it will stop at the same point asprinting n-(x+1)

Answer 14

ahhh whatever its too hard to explain in words lol...
both our ideas work so just use the one that makes sense to you haha..
arite cya

Answer 15

haha alright later

Answer 16

Hey sorry about earlier I had just woke up and what you were typing jut wasn't making sense but yes you are right the way I did mine won't come out correctly every time thanks for pointing that out and I fixed mine haha.