Job Listing: Wanted: Master Software Developers at Neo Henry Ware (6)
Note by Heri: this is an original and innovative ad. See the puzzle at the end.
Company: Neo Henry Ware
Position: Wanted: Master Software Developers
Responsibilites and Tasks:
01/18/2008
1. You’re an artist, and software is how you express yourself.
2. You believe there’s always a better way of doing things.
3. You embrace positive change, even when it means relearning what you know.
4. You’re passionately committed to quality.
5. You’re always looking for ways to eliminate waste, at all levels of development.
6. You’re a team player, and you love (not just like) working with others.
7. You continuously strive for self-improvement.
8. You love to teach what you know, and learn what you don’t.
9. You like to have fun while writing software.
10. You’re extreme about your programming.
11. You can find out the significance of the date “01/18/2008″.
12. You can find out who we are and how to reach us (no, we won’t reply to the Contact link!).
Here’s your clue:
eyAnOicgPT4gJycsICcgJyA9PiAnLScsICdzXG4nID0+ICdzLmNvbVxuJyB9 (3548, 4648)
Good luck!
Compensation:
Depends on Experience
Damn those puzzles! (Anyone reminded of http://xkcd.com/356/ ? )
Anyhow, I solve the first step, seems there’s 3 more to go. I’ll look at it later. :)
I got to the website by decoding the text but can’t figure out the next puzzle. What does “TDD” mean?
sarah: for me TDD means test driven development
Thank you, I think that’s the key (there are tests on the left side of the puzzle)! I will read about it.
coLLAborATE
canFall = function(d, row, col) {
// can’t fall from top row
if (row == 0) return false;
// can’t fall if there’s a block on the right
if ((col + 1 0) && d[row-1][col-1] && d[row-1][col]) return false;
// can’t fall if there are blocks below us on either side
if ((0 < col && col + 1 < d[row].length)
&& d[row-1][col] && d[row][col-1] && d[row][col+1]) return false;
// *can* fall if there’s nothing below us
if (!d[row][col] && d[row-1][col]) return true;
return false;
}
fall = function(d, row, col) {
d[row][col] = true;
d[row-1][col] = false;
}
f = function(d) {
var original = new Array(d.length);
for (var row = 0; row < d.length; row++) {
original[row] = new Array(d[row].length);
for(var col = 0; col < d[row].length; col++) {
original[row][col] = d[row][col];
}
}
for (var col = 0; col 0; row–) {
if (canFall(original, row, col)) {
fall(d, row, col);
}
}
}
}
Leave a Reply