hi all, just a notice that this saturday we (berkeley data systems) will be hosting a utah-resident-only coding contest. we will be awarding the winner w/ a $10K prize.
see details and a couple of sample problems below, or go to http://mozy.com/contest -josh -------------------------------------------------------- Mozy Programming Contest The contest will be held on November 4th. Yes, we really will be giving away $10,000 on Saturday November 4th to the winner of the Mozy Coding Deathmatch. Why are we doing this? Two reasons: 1. Yes, this is a thinly disguised recruiting effort to find the best local engineers. 2. Incentivizing technical awesomeness is always a good thing. Rules * You must be over 18 years of age. * You must be a full-time resident of Utah. * You must be eligible for full-time employment in the US. Please note that although we are looking for the most awesome programmers in the area, the winner has absolutely no obligation regarding employment at Berkeley Data Systems. This contest is just that: a contest. Registration will open 24 hours before the contest begins at http://mozy.com/contest November 4th Deathmatch Schedule 10:00 Round 1 (~1 hour) at http://mozy.com/contest 12:00 Round 2 (~1 hour) at http://mozy.com/contest 4:00 Final Round (~1.5 hours) at 774 East Utah Valley Drive, American Fork, UT The following languages are permitted: * C * C++ * Java * Ruby * Python * C# * Lisp * Perl All source code must be in a single file, and only 'standard' libraries will be permitted to be used. If you are using a compiled language, the compilation command that you want to use must appear at the beginning of your source file. When applicable, problems will show sample input and the corresponding correct output. The actual problem input will also be given, and your code should assume that the input is coming via standard input (stdin) and your code should print results to standard output (stdout.) You can assume all input will be valid in the context of the problem (ie. your code will not have to check for invalid or garbage input.) All problems will be timed, and to complete a problem you need to cut & paste your code, and your answer into two text boxes on the problem web page and click the submit button. To participate in the next round, you will need to re-login. Upon logging in, you will be told whether or not you qualified for the next round. Round 1 and 2 will consist of several problems. They are all timed. At the end of the time limit for each problem, the page will refresh and go on to the next problem. If you have not submitted your code and answer in the given time, you will be able to continue with the round, but obviously submitting your code and answer is preferable. About the Final Round: Only a handful of participants will qualify for the final round. The winner of the final round will not only need to produce the correct answer, but their code will need to produce the correct answer in least amount of execution time (wall-clock.) Yes, we realize some languages will have an advantage in this regard - but the trade-off between ease of implementation and performance is part of the challenge. Note that it will be held here at our office in American Fork. Get notified when more details are posted Email: (We won't use this address for any purpose besides contest notifications.) Sample Question 1 All questions will be timed, and this particular one should be able to be finished in less than 5 minutes. We'll post some more of these over the next couple of weeks. We are looking for sequences of n > 0 integers where the absolute values of the differences of successive elements are included in the set of numbers 1 through n - 1. For instance, 4 1 2 3 is a match, because the absolute differences are 3, 1, and 1, respectively where n is 4. 8 6 2 is not a match, because the absolute differences are 2 and 4 respectively where n is 3. The definition implies that any sequence of a single integer is a match. Write a program to determine whether each of a number of sequences is a match. Input Each line of input contains a sequence of n integers where n < 1024. Output For each line of input generate a line of output printing 'match' or 'not a match'. Example Input 5 3 2 -4 2 1 2 4 7 -3 2 1 4 3 3 6 3 4 6 7 3 4 5 12 14 -4 -9 -18 5 22 41 43 29 17 -2 7 19 22 23 24 3 9 Example Output not a match match not a match match not a match Sample Question 2 This is an example of a question that wouldn't require source code to be submitted. Order the following functions in order of runtime speed: n log n n^3 sqrt n n! ln ln n n 2^n n^2 log n e^n /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
