hacker.org

Hi there,

i finally found a solution myself.
My solution is a bit different to those above, so i post it, too:
0<11+0>0<<01^3^1^8?:g d0<3cp


Because there is still a "do nothing" opcode in it,
i hope i can get it still one shorter for the next challenge.

Ok, if you post your solutions I'll post mine ..

0<01^1^<:2/5?0^<1v1+0^<2?3cdp

Since I've already seen a bunch of different approaches ... maybe I can pick up some optimization-ideas ...

Michael

First my solution looked like the one from sigi - but then i decided to add some fun to it:

Go through that array from behind So I start with the number after the input number which is 0, like some others did too
Unfortunately this no longer works, cause on the 5th test there are all negative numbers

therefore I decided to cheat a bit and forget about the last number, and just begin with the 19th well, it worked

I think that any solution accepted by the server is a valid solution. Even if that means playing the numbers game and having it get the correct number only most of the time The idea with these challenges is to force hackers to come up with novel solutions to problems. We should not frown on those who use statistics to their advantage...

that said, here's my code for this one:

10^<0^28*?0<:1+5?0^<0>1+1c0<p

I'm guessing i can shorten it quite a bit by moving the position of the first test

10^<0<1^:1+2/>1+0^45*-2?1c0<p

45*1-0^<0^0<:1+3?0>0d0^2?3c<p

This is really nice challenge series ... except the boring last step (fighting the probability) ... my engine fights for several months already ... and is as far from the solution as after first day (what is further then before start).

Hippo wrote:This is really nice challenge series ... except the boring last step (fighting the probability)

That one should never have existed. It doesn't make sense.