About a month ago, Google launched the Google Treasure Hunt challenge with the following code:
Solution: base64 decode
Note: The Google Treasure Hunt page is built on Google's App Engine platform.
Solution to Problem 1:
Problem 1 is a standard pascal's triangle kind of problem involving big numbers.
My solution is in C.
Solution to Problem 2:
For this problem, you need a bash shell. Modify this script accordingly...
Solution to Problem 3:
Problem 3 is relatively easy, once you get the definitions right. It can even be done using pen and paper! You need to understand that "A.B.C.D=>W.X.Y.Z" means if your destination IP is A.B.C.D, then your next target IP is W.X.Y.Z. Also, "A.B.C.0/24" means "A.B.C.*"
This is my solution in C.
Solution to Problem 4:
I used the bigint class for this problem. This question is the toughest among the 4 questions. You may even need to generate up to 90000 prime numbers to solve it. (if you have a better solution, please share...)
This is my solution in C++. Takes minutes to generate the solution. So pls be patient.