Trivia 3: http://en.wikipedia.org/wiki/Tivoization
And then "res" compared to 0. If it is 0 it return success else wrong key. So our aim is to get "ris" 0 at the end of this process but how? Easy just reverse those lines I pasted up starting from the bottom:
- res must be 0 so just have to XOR it for 4153. So res=4153
- res must be 4153 so just multiply it for 4. So res=16612
- res must be 16612 and it is zero fill right shifted.
Now just add the 6 bits that has been shifted:
//100000011100100000000 1063168 min
//100000011100111111111 1063423 max
//100000011100100001100 1063180 <-- right one obtained bruting numbers till a number % 17 returned 0. So res=1063180
- res must be 1063180 so just div it for 17. So res=62540
No the sum must return 62540. For this one just add character to the key till you get close to it then just adjust with the first chars in the string that has been less influenced by the sum of "i".
The string I submitted was "vzzzzzzzzzzzzzzzzzzzzzzzzzzzzzD8:"
Output: Congrats! you passed the level! Here is the key: