Programming Exercise #8: Parking

[Tolnaftate2004]

Originally Posted by fowlplay4

I ended up with something like this:

snip

I don't think that's the 'linear' way though since when N=4 I get 1.666_. If I track the patterns and ignore ones that have already been generated I get the right answer for N=4.

I think you're close. 1.666 may be due to treating the circular lot as if it were linear? I can't really tell...

[fowlplay4]

Originally Posted by Tolnaftate2004

I think you're close. 1.666 may be due to treating the circular lot as if it were linear? I can't really tell...

These would be the full combinations (N=4):

1122
0110
2211

(2 + 1 + 2) / 3 = 1.666_

If we don't care about the order:

1111
0110

(2 + 1) / 2 = 1.5

Like in your example. The code I have edited in there ignores the order so I do get 1.5 with it, problem is that it has to go through all the permutations first so it scales horribly.

[Tolnaftate2004]

Originally Posted by fowlplay4

These would be the full combinations (N=4):

1122
0110
2211

(2 + 1 + 2) / 3 = 1.666_

If we don't care about the order:

1111
0110

(2 + 1) / 2 = 1.5

The example I gave was wrong, unfortunately. I can't edit that post. it should be 1.666...
The number of cars that can fit in a lot of size 4 is 2. No matter where the first car parks, there is always room for the second car.

[xAndrewx]

Originally Posted by Tolnaftate2004

The example I gave was wrong, unfortunately. I can't edit that post. it should be 1.666...
The number of cars that can fit in a lot of size 4 is 2. No matter where the first car parks, there is always room for the second car.

kewl