You're viewing a comment by Ramesh Kumar Poliah and its responses.

August 30, 2008, 07:56

Hi,
I solved this fourth problem of Google Treasure Hunt 2008 in very easy way. I just write a C program to give the required output. By this program you can solve for the numbers upto 2^31.(upto any 10 digit number). I submited answers for so many problems of this kind. I got the confirmation for the first problem that I solved.

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.