Haven't We Met Before?

[kalunos]

hi all,

here comes my solution to this hvm-hack:

(formatted with spaces, in the form
jumpToStart!compareRoutine! initSize outerLoop innerLoop+call(compare) checkInnerLoop )

9g!-1?$<pd! 5 1-0^2?2gd! 0^<1^1-0^<2^3c 0^7?054*-g!dd085*-7-g

happy coding!

max.

[kne1p]

hi, my version is only double the length
because i'm stupid my function is at the end, not the beginning,
and because i'm lazy, all variables are stored in memory and loaded each and every time they are needed

Code: Select all

29+27*>2 7*<<44*>27*<1-35*>88*c36*<44*?27*<1-27*>806-*g44*<p!   35*<<44*<-46*?35*<46*?35*<1-35*>05-8*g036*>$  136*>$

or in "pretty-print"

29+27*>
2 7*<<44*>
27*<1-35*>
88*c
36*<44*?
27*<1-27*>806-*g
44*<p!

   35*<<44*<-
46*?
35*<46*?
35*<1-35*>05-8*g
036*>$
  136*>$

[compudemon]

i abuse c to avoid negative jumps

00^1+1^<1^<1^:2?2gp!d0^29+:2?3cd1+1c

[lvhao945]

00^1+1^<1^<:96+?0^9-2-2?3cd1+1c<p

[rmplpmpl]

77*8+g66+<<p!66+<<67+<<-2?2g6c67+<1+67+>67+<66+-2?1g$01-59**5-g066+>167+>67+c66+<1+66+>66+<1+67+>01-66**2+g

...guess, I have to learn a lot....

[sascha27]

Call free version, but spaming on the stack (too lazy to clean)

66+0^0^2v1-0^0^0^47*?<1v0^055*-?1-0^<2^-9?083*-g0<p<p

[avrrobot]

93+01^1^:99+9+9+7+?93+1^1+1^1^:99+1+?0^<3^<:96+?1+99+8+cdd1+4c!<p

Could be optimized, but it worked

[Tabun]

Actually the first HVM challenge that I feel I got too much bloat on.. Fun one though!
00^<1v0^1+2v0^2v0^<2v:83*?0^92+:2?6gdd1+1c1+1v93+c<p

[Napoleon]

010^93+:76*2+?1^<0^2^<:1+72*2+?d1^<0^2^<:1-2?p!d1+069*-2-gd1+0^1+097*-8-g

You guys seem smarter than me, if you compare length xD