OJ Board

Thanks, very nice examples!

Well my strategy is pretty simple, but it appears to have one flaw. I got some ideas from knots theory websites on the web. I am looking for 3 possible situations: first is a simple when I see sequence like "... -5 +5 ..." I call it a LOOP and it can be removed from ...

To Korken:

Wa, I am cheater!!!

If it's so easy, prove it. You do it what you say.

Der-Johng Sun

-3 +6 -4 +2 +1 -7 -6 +4 -2 +3 +5 -1 +7 -5 0
-8 +5 +4 -2 -5 +8 -1 +3 -9 -7 +6 -4 +2 -6 +7 +1 -3 +9 0
6 -7 +2 +9 +3 -4 +8 -10 +1 -5 +7 -2 +5 -6 -9 -1 +10 -3 +4 -8 0
-9 +14 -11 +6 -15 -8 +4 -13 +1 +10 -6 -12 -3 +7 -2 +11 -14 +9 -10 +15 +12 +5 -7 -4 +13 +2 -5 +3 +8 -1 0
-1 +2 -3 +4 -5 +6 -7 +8 -9 +14 ...

Keep getting wrong answer, any test data? I have ran it on several things and works for each case.

Try this.

13
19
raloha
arachnid
dog
gopher
rat
tiger
aloha
raloha
arachnid
dog
gopher
rat
tiger
aloha
arachnid
dog
gopher
rat
tiger
3
oak
maple
elm
6
ab
ba
bc
ca
ad
da
3
aabba
aabb
ba
4
ab
ac
ad ...

:-?

the example:
1000 3
250 20 20
500 40 40
750 19 19
0 0

I don't understand why the answer is 998.03?
(v + 1/v - 0.1)*(1000/v) = 998.03
mean
v = 13.69455

then when the driver arrive the first light, he spent 18.255 sec.
(250/13.69455 = 18.255)
he should be stoped by the red light.

Isn't it ...

Strangely, Case 6, should be 1? that match rule 4.

10
C
F
I
A
D
G
J
B
E
H

Try This:

1
165
1 2 3 2 1 1 5 1 1 1 1 10 1 4 4 41 4 4 1 43 4 4 4 41 4 4 42 4 4 1 13 1 1 1 2 3 2 1 11 1 1 1 1 1 19 1 4 4 41 4 4 1 4 34 4 4 24 4 4 4 4 4 11 1 1 1 1 21 3 2 1 12 1 1 1 1 15 1 1 44 4 4 4 4 1 4 41 4 4 14 4 4 4 4 4 12 1 1 1 1 20 3 2 1 1 1 1 1 1 1 1 1 4 4 4 4 4 1 4 4 4 4 4 4 4 4 4 4 1 1 1 1 ...