Imagine a spiral staircase, where walking [n, w, s, e] will result in going up (or down) the stairs. But walking [n, s, e, w] in that order will result in staying put.
Anyway, better to follow the problem spec than to complain about it.

@mowmoth: This is no problem of the language! There is no problem in the tests, but in your solution!
The line you show with "1010101010101010101010101010" cannot make sense. "0000000000000000000000000000" as part of the pattern is completely right!

See in the description in the example for pattern 11!

I have notified the translator, he will be reviewing this soon.

Second that. Took me way longer to figure out the format than it took to create the actual shapes. For everyone wondering: remove \n at the end of the string and for numbers > 9 only use the last digit.

Sorry, should have added that. C#

Language?

No:-) Read some comments below.

Shouldn't N -> W -> S -> E result in a circular motion?

Random test for 66
✘ Expected string length 38611 but was 57751. Strings differ at index 1838.
Expected: "... 0000000000000000000000000000..."
But was: "... 1010101010101010101010101010..."

This doesn't make any sense, does it? First of all 66 ∈ (-∞,50]? Second, there is no number in 66 that would justify this many zeroes. Am I missing something here?

Ok. I've changed this.

What kind of a description is this?

Write function 'factorial' - this is a Haskell 'Hello World' like kata.

Strange, can't get this working in C#. Put the same code into LINQPad and it compiled wonderfully. I'm just gonna skip this.