Did anybody solve this?

#1

Post by jgrahamc » Fri, Dec 23, 2011, 5:32 PM UTC

Did anybody solve this?
1.61803398874.com

Re: Did anybody solve this?

#2

Post by kuriraisu » Fri, Dec 23, 2011, 6:08 PM UTC

Yes. Use the modulus implementation of the vignere cypher. Then look up how C and python handle modulus.

Re: Did anybody solve this?

#3

Post by joe_bleau » Fri, Dec 23, 2011, 6:11 PM UTC

Sure, I did it by hand. Not sure it was really challenging enough to impress me, though.

Re: Did anybody solve this?

#4

Post by dli282 » Fri, Dec 23, 2011, 6:12 PM UTC

Yes. The secret URL is rethinkdb.com The key 61803398874 corresponds with the letter of the alphabet with a as 0. Enjoy!

Re: Did anybody solve this?

#5

Post by a3_nm » Fri, Dec 23, 2011, 6:16 PM UTC

Also, did anyone solve their "canine challenge"? It seems to me that what they're asking for is "tee FILE... > /dev/null", but maybe I'm missing something?

Re: Did anybody solve this?

#6

Post by [deleted] » Fri, Dec 23, 2011, 6:16 PM UTC

[deleted]

Re: Did anybody solve this?

#7

Post by dexen » Fri, Dec 23, 2011, 6:24 PM UTC

a3_nm wrote: post #5

Also, did anyone solve their "canine challenge"? It seems to me that what they're asking for is "tee FILE... > /dev/null", but maybe I'm missing something?

The only problem with `tee' is that it's hard to find it unless you know where to look -- took me some 2 years.

Perhaps the real challenge here is sticking with the team that produces incredible qunatities of code, as they put it, and will rather re-implement tee than find it. I wonder if they implemented own virtual memory with on-demand paging yet ;-)

Re: Did anybody solve this?

#8

Post by ryanlchan » Fri, Dec 23, 2011, 6:28 PM UTC

Read up on the Vigenere cipher on Wikipedia. If you still aren't getting it, reconsider which direction you are shifting the cipher text in accordance with the key. Good luck!

(Or do some social engineering and figure out which db company has a 9 letter name.)

Re: Did anybody solve this?

#9

Post by jerfelix » Fri, Dec 23, 2011, 6:33 PM UTC

Spoiler Alert!

The answer is rethingdb. Apparently an ad for rethinkdb.com:

    >>> print "".join((chr((ord(x)-int(y)-ord("a"))%26+ord("a")) for x,y in zip("xfbhlqtlj","61803398874")))
    rethinkdb

Re: Did anybody solve this?

#10

Post by mvgoogler » Fri, Dec 23, 2011, 7:00 PM UTC

dexen wrote: post #7

a3_nm wrote: post #5

Also, did anyone solve their "canine challenge"? It seems to me that what they're asking for is "tee FILE... > /dev/null", but maybe I'm missing something?

The only problem with `tee' is that it's hard to find it unless you know where to look -- took me some 2 years. Perhaps the real challenge here is sticking with the team that produces incredible qunatities of code , as they put it, and will rather re-implement tee than find it. I wonder if they implemented own virtual memory with on-demand paging yet ;-)

Except that if you read the problem statement, you'll see that tee doesn't meet the requirement of 'taking advantage of all available I/O parallelism'. Tee writes to each output file sequentially.

Given that their core business is data-stores that take full advantage of emerging storage technologies (such as flash), this seems like pretty relevant question.