You are starting a secret coding club with some friends and friends-of-friends. Not everyone knows each other, so you and your friends have decided to create a secret handshake that you can use to recognize that someone is a member. You don't want anyone who isn't in the know to be able to crack the code.
You've designed the code so that one person says a number between 1 and 31, and the other person turns it into a series of actions.
Your task is to convert a number between 1 and 31 to a sequence of actions in the secret handshake.
The sequence of actions is chosen by looking at the rightmost five digits of the number once it's been converted to binary. Start at the right-most digit and move left.
The actions for each number place are:
00001 = wink 00010 = double blink 00100 = close your eyes 01000 = jump 10000 = Reverse the order of the operations in the secret handshake.
Let's use the number
9 as an example:
That was the last digit, so the final code is:
Given the number 26, which is
11010 in binary, we get the following actions:
The secret handshake for 26 is therefore:
jump, double blink
If you aren't sure what binary is or how it works, check out [this binary tutorial][intro-to-binary]. [intro-to-binary]: https://medium.com/basecs/bits-bytes-building-with-binary-13cb4289aafa
AWK does not have the common bitwise operators that many other languages have (like
Instead GNU awk provides bitwise functions.
Sign up to Exercism to learn and master AWK with 59 exercises, and real human mentoring, all for free.