Username: Password:

InVERT Elimination - Second Round

Starts- 10:00 PM, 8th November, Saturday.
Ends- 10:00 PM, 15th November, Saturday.
Think... code... win.


To download the pdf of this round, click here.


Instructions

Please follow the instructions strictly.


  1. To win the war, all you have to do is make a folder INxxxx (xxxx being your team Reg. No); make 3 subfolders (name them 1, 2, 3) in it. Place the answer to every question in the folder with the same name and don't forget to include a readme!!!
  2. Archive this main folder, using any of the following tools: zip/tar/rar /tar.gz /tgz /bz2; and mail it to codewars@techfest.org , with the subject 'Round2 - INxxxx', where xxxx is your team Reg. No.
  3. The mail must contain all the information needed to extract the file.
  4. The teams must submit their mail on or before 10:00 pm IST, 15th November 2008. Teams have ONLY ONE chance to submit, so use it wisely.
  5. Techfest will not be responsible for any email bounces, hence pay attention to restrictions imposed on attachments by mail clients/sites. On successful receipt of your mail, an acknowledgment mail will be sent back to the participant, within 12 hours time.
  6. Please direct all queries to the forum for a quick response. Teams found discussing problems in any forums will be disqualified instantaneously.

Task 1: Pick the Pic

Write the answers in a text file and place them in folder 1.


  1. Identify the person in the below picture.



  2. Identify this Monument and its relevance.



  3. This is a famous comic on a famous topic. Submit the blanked out words and explain their relevance.





Task 2:Math Riddles

Solve the following questions, write the answers in a text file, riddle.txt, and place it in the folder 2.


  1. You have 3,000 figs and a donkey which can carry at most 1,000 figs at a time. The donkey eats a fig before moving a metre. You want to transport the figs 1 km to the next city. What is the maximum number of uneaten figs that you can move across?
  2. Raj and Shyam are staying in different rooms in the same hotel. Raj needs to give a secret document to Shyam, but spies are trying to assassinate Raj and Shyam so neither of them can leave their room. The only way they can transfer objects is by using the waiter Mahesh. Both Raj and Shyam have a safe with a large clasp that can be secured with a lock. Both Raj and Shyam have a lock and a corresponding key. But Mahesh is a thief. Anything that is not locked in the safe will be stolen by Mahesh - including any unlocked locks, the keys or the document. How can Raj transfer the document to Shyam without it being stolen?
  3. Find out all the digits replaced by alphabets in this long division.




Task 3: Reversing.

Solve the following questions, write the answers in a text file, invert2.txt, and place it in the folder 3.

Crack the EXEs and submit the fields asked for in each level.

To download the EXEs click here.