Ruby, 376 375 368 363 362 bytes ->a{p='ALLITROT'.chars s='LATORTIL'.chars t=[' TORTIL'] c=[*a.split(?,).chunk(&:upcase)] c.map.with_index{|x,i|n=x[1].size*2 w=x[0].tr(' ','')*9*n [n+=i==0?1:0,w.sub!(/..../,' \0 ')]if i==c.size-1 w.chars.each_slice(6).take(n).reverse.map{|l|t=["#{p.shift||' '}...

Complement Cat answer-chaining Objective Write an answer that outputs the previous answer. Simple enough, right? Well, here's the catch: You may not use any characters that were present in the previous answer. That's right, none of them. Thus, you are trying to be the last answer for a total ...

In essence, this proposal is to move from a copyleft license (CC-BY-SA 3.0) to a permissive license for code. (By default, it's basically the most permissive license possible, nearly equivalent to public domain with a liability disclaimer.) Having thought about it for a couple of hours, I've sh...

Complement Cat answer-chaining Objective Write a program that outputs an arbitrary string of text, no more than 64 characters long. Simple enough, right? Well, here's the catch: You may not use any characters that were present in the previous answer's output. That's right, none of them. Thus, ...

The fastest random generator you could implement is this: XD, jokes apart, besides everything said here, I'd like to contribute citing that testing random sequences "is a hard task" [ 1 ], and there are several test that check certain properties of pseudo-random numbers, you can find a lot o...