[Equinox]

n=1 still prints [0,1]. It should just print [0].

Fixed, again. If this isn't it, I'm hanging the ethernet cord. You can ask @"Panty" what the means if you want to know.

Examples (0,1,6,20):

Code:

LVL 79 (1716/3853) ~ ●●● node ~/bin2.js [] LVL 79 (1803/3853) ~ ●●● node ~/bin2.js [ 0 ] LVL 79 (1891/3853) ~ ●●● node ~/bin2.js [ 0, 1, 1, 0, 1, 0 ] LVL 79 (1981/3853) ~ ●●● node ~/bin2.js [ 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1 ]

100 bytes exactly, with 1 digit values.

[Shebang]

Yeah he just needs to set it to print the first n elements of what's returned.

Fixed, again. If this isn't it, I'm hanging the ethernet cord. You can ask @"Panty" what the means if you want to know.

Examples (0,1,6,20):

Code:

LVL 79 (1716/3853) ~ ●●● node ~/bin2.js [] LVL 79 (1803/3853) ~ ●●● node ~/bin2.js [ 0 ] LVL 79 (1891/3853) ~ ●●● node ~/bin2.js [ 0, 1, 1, 0, 1, 0 ] LVL 79 (1981/3853) ~ ●●● node ~/bin2.js [ 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1 ]

100 bytes exactly, with 1 digit values.

Looks like it's working! Nicely done

Both of you feel free to update your answers to shorten them if you'd like A quick note, you may define an anonymous lambda function to do the work for you, which seems similar to what Stocking did. In that case, only the body of the function is your byte count! (I think that makes your solution around 91 bytes or so, Stocking).

I'll reveal my reference solution in a few languages once the challenge is over.

[Equinox]

Looks like it's working! Nicely done

Both of you feel free to update your answers to shorten them if you'd like

I'll reveal my reference solution in a few languages once the challenge is over.

I'm going to work on @Eclipse's solution. Since I know that making it even smaller would bother him.

[Shebang]

I'm going to work on @Eclipse's solution. Since I know that making it even smaller would bother him.

If you can get anywhere close to my reference Python solution I will be impressed

[Eclipse]

I'm going to work on @Eclipse's solution. Since I know that making it even smaller would bother him.

Screw you.

Spoiler:

Tell me how you manage.

[Equinox]

http://repl.it/BBso
119 bytes

Example outputs:

Code:

T0 --> 0 T1 --> 01 T2 --> 0110 T3 --> 01101001 T4 --> 0110100110010110 T5 --> 01101001100101101001011001101001 T6 --> 0110100110010110100101100110100110010110011010010110100110010110 T7 --> 01101001100101101001011001101001100101100110100101101001100101101001011001101001011010011001011001101001100101101001011001101001

EDIT: I may try golfing this further.

If you can get anywhere close to my reference Python solution I will be impressed

Screw you.

Spoiler:

Tell me how you manage.

Did it in 79 bytes (77 if you take away the first set of parenthesis).

Code:

>>> r = lambda i: [(0 if int(bin(x)[2:].count('1'))%2==0 else 1) for x in range(i)] >>> r(0) [] >>> r(1) [0] >>> r(6) [0, 1, 1, 0, 1, 0] >>> r(20) [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1]

[Shebang]

Did it in 79 bytes (77 if you take away the first set of parenthesis).

Code:

>>> r = lambda i: [(0 if int(bin(x)[2:].count('1'))%2==0 else 1) for x in range(i)] >>> r(0) [] >>> r(1) [0] >>> r(6) [0, 1, 1, 0, 1, 0] >>> r(20) [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1]

Nicely done Remove some spaces in a few places and change the logic slightly, and you'll be close to the reference solution length You can also remove the function definition (i.e. r=) and just let it be an anonymous lambda function.

[Shebang]

There's only a little over 24 hours left to go! Get your entries in!

[Equinox]

There's only a little over 24 hours left to go! Get your entries in!

Adding all my NSP to the pot (25).

[Shebang]

Adding all my NSP to the pot (25).

Awesome, thanks!

---

Adding all my NSP to the pot (25).

I would also like to point out that if you want, you can golf your current Py2 solution down to the optimal fairly easily