Posts which you will also like.

Saturday, April 14, 2012

What is Google Code Jam ?

Recently I participated in Google Code Jam 2012.
It is one of  greatest international programming contest in the world and It is organized by Google.
It comprises of some toughest and challenging programming problems which you have to solve for small input set and for large input set withing a time limit.

For programming you can choose any language you are adept at i.e there is know language restriction by Google.

First round called Qualification round after that there are three or more rounds.Participants are from all around the world .Winners are awarded magnificent prizes and chance to work with Google.
So from next time keep eye on the upcoming Code Jam contest and try your best.
It's main website is 

You can read some of problem asked here......


We have come up with the best possible language here at Google, called Googlerese. To translate text into Googlerese, we take any message and replace each English letter with another English letter. This mapping is one-to-one and onto, which means that the same input letter always gets replaced with the same output letter, and different input letters always get replaced with different output letters. A letter may be replaced by itself. Spaces are left as-is.
For example (and here is a hint!), our awesome translation algorithm includes the following three mappings: 'a' ->'y', 'o' -> 'e', and 'z' -> 'q'. This means that "a zoo" will become "y qee".
Googlerese is based on the best possible replacement mapping, and we will never change it. It will always be the same. In every test case. We will not tell you the rest of our mapping because that would make the problem too easy, but there are a few examples below that may help.
Given some text in Googlerese, can you translate it to back to normal text?
The first line of the input gives the number of test cases, T. T test cases follow, one per line.
Each line consists of a string G in Googlerese, made up of one or more words containing the letters 'a' - 'z'. There will be exactly one space (' ') character between consecutive words and no spaces at the beginning or at the end of any line.


For each test case, output one line containing "Case #X: S" where X is the case number and S is the string that becomes G in Googlerese.


1 ≤ T ≤ 30.
G contains at most 100 characters.
None of the text is guaranteed to be valid English.
ejp mysljylc kd kxveddknmc re jsicpdrysi
rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd
de kr kd eoya kw aej tysr re ujdr lkgc jv
Case #1: our language is impossible to understand
Case #2: there are twenty six factorial possibilities
Case #3: so it is okay if you want to just give up

No comments:

Post a Comment

Your comment may wait for moderation.... Protected by Copyscape Online Plagiarism Tool