JCOm

rev_kids20

Task: tiny 32-bit PE console binary that takes a number argument, runs a slow naive Fibonacci-like recursion, and prints 'Success' when the result equals a magic constant. Solution: reverse the recurrence f(n)=f(n-1)+f(n-2)+1, compute it iteratively with 32-bit wraparound, and brute-force the argument n whose value equals 0x33ad3349 -> n=43.