Oh well, this challenge, unlike the other huge answer-chaining one, doesn't get exponentially harder, so hopefully we'll go over 150 answers sooner or later
Definition1
A Kolakoski sequence is a self-describing infinite sequence {kn} of alternating blocks of 1's and 2's, given by the following rules:
k0 = 1
kn = the length of the (n+1)'th block
The Task
Given a positive integer n, generate the first n elements of the Kolakoski se...
@StepHen I think I hopefully don't cause too many problems as long as nobody's chained onto the end of mine. Besides, I just posted it like 2 minutes ago.
Create a binary wall
code-golf
Given an array of positive integers, n > 0, output their representation of a binary wall.
How does this work?
Convert each number to it's binary representation.
Pad the representation with leading zeroes to the length of the longest one i.e. 1, 2 -> 1, 10 -> 01...
This is an answer chaining question that uses sequences from OEIS, and the length of the previous submission.
This answer chaining question will work in the following way:
I will post the first answer. All other solutions must stem from that.
The next user (let's call them userA) will find the...
If there isn't a sequence for then length of the last post, then the sequence for your post is the lowest unused sequence. once this happens it's gonna screw people over
Definition1
A Kolakoski sequence is a self-describing infinite sequence {kn} of alternating blocks of 1's and 2's, given by the following rules:
k0 = 1
kn = the length of the (n+1)'th block
The Task
Given a positive integer n, generate the first n elements of the Kolakoski se...
@LeakyNun post first format next...I was really lucky I got that one and no time for formatting when you have to ninja...I'd have formatted after ninja is done ;) (also my internet is slow...)
@Mr.Xcoder I could wait for an hour and if no-one posts, I'd then be able to post again. Or I could wait for someone to post, make a 5 min solution and post again. I think its better with both.
Inspired by this challenge (thanks @cairdcoinheringaahing for the title!), your task is to take two printable ASCII strings and multiply them element-wise with the following rules.
How does it work?
Given two strings (for example split and isbn) you will first, truncate the longer one such that...
@cairdcoinheringaahing If there isn't a sequence for then length of the last post, then the sequence for your post is the lowest unused sequence. does that remove that byte count from the running too?
@cairdcoinheringaahing: I'll be messing with adding a Stack Snippet into your question to make answering easier; please excuse the edits. Is that alright?
CMC: Given a letter (uppercase or lowercase) output its position in the English alphabet with A=1 to Z=26, but if given a number 1 <= n <= 26 instead output that letter.
COMMENTS a(n) = number of partitions of n with even rank minus number with odd rank. The rank of a partition is its largest part minus the number of parts.
It would be easy in Mathematica: CoefficientList[Series[(1+4Sum[(-1)^n q^(n(3n+1)/2)/(1+q^n), {n, 1, 10}])/Sum[(-1)^n q^(n(3n+1)/2), {n, -8, 8}], {q, 0, 100}], q], but it's taken
Problem : Vaults in Bank
In the strong room of ABC bank there are N vaults in a row. The amount of money inside each vault displayed on the door. You can empty any number of vaults as long as you do not empty more than 2 out of any 5 adjacent vaults. For example, of the vaults 1, 2, 3, 4, 5, if ...
@MDXF I suggest you to wait a bit, because the recent challenges (especially cairdcoinheringaahing's) will draw most of the attention from your challenge
Problem : Vaults in Bank
In the strong room of ABC bank there are N vaults in a row. The amount of money inside each vault displayed on the door. You can empty any number of vaults as long as you do not empty more than 2 out of any 5 adjacent vaults. For example, of the vaults 1, 2, 3, 4, 5, if ...
Question: Currently my string/list repetition operator puts the result in reverse for a negative number. So for a repeat each element operator, should the result still go in reverse for a negative
9. Pyth, 19 bytes, A000025
?>Q0sm@_B1-edld./Q1
Test suite.
Next sequence
a(n) = number of partitions of n with even rank minus number with odd rank. The rank of a partition is its largest part minus the number of parts.
@LeakyNun I am very tempted to press that downvote button, just because you've driven us to A000019, and on the other hand I am tempted to press that upvote button, because you solved A000025 in Pyth...
Definition1
A Kolakoski sequence is a self-describing infinite sequence {kn} of alternating blocks of 1's and 2's, given by the following rules:
k0 = 1
kn = the length of the (n+1)'th block
The Task
Given a positive integer n, generate the first n elements of the Kolakoski se...
Create a binary wall
code-golf
Given an array of positive integers, n > 0, output their representation of a binary wall.
How does this work?
Convert each number to it's binary representation.
Pad the representation with leading zeroes to the length of the longest one i.e. 1, 2 -> 1, 10 -> 01...
This is an answer chaining question that uses sequences from OEIS, and the length of the previous submission.
This answer chaining question will work in the following way:
I will post the first answer. All other solutions must stem from that.
The next user (let's call them userA) will find the...
Inspired by this challenge (thanks @cairdcoinheringaahing for the title!), your task is to take two printable ASCII strings and multiply them element-wise with the following rules.
How does it work?
Given two strings (for example split and isbn) you will first, truncate the longer one such that...
