Recently this question caused a bit of a stir. The admitted goal of the challenge was to replace our old fibonacci question which the op felt was outdated.
The question was closed twice by high rep users holding code-golf badges, and reopened twice by regular users. It currently has two additi...
That would be me. I thought about it, and decided that too many of the original Fibonacci answers would be able to be trivially ported here, but decided against it a bit later (hence the retracted close vote) because I feel like the other challenge is too old and this offers some spots for some interesting golfs with languages that have Fibonacci builtins.
@totallyhuman I could try to make one sometime o0 or blackmail persuade Dennis
CMC: n -> [1, 2, 3, ..., n-2, n-1, n, n-1, n-2, ..., 4, 3, 2, 3, ..., n-3, n-2, n-1, n-2, n-3, ..., 5, 4, 3, 4, ..., etc]. Essentially, the values keep going up and down with the bounds moving closer and closer each time
@WheatWizard ooo I should make a "Hoogle" like search then. makes it easier ( ;) )
one of these days I should just say something and then if I ninja them I'll just say "ninja'd (and I'm ninja-ing you again)" and watch them get ninja'd predictively
Basic rules (different then mine)
Story
It is the year 4579, humans now have 2 hands with 1001 fingers each. Chopsticks has become based off of points. And @Dennis has more rep the @Martin... Hand drawn red circles are now downvoted... Jon Skeet has hit 2 trillion rep on every SE site... Yeah s...
One OEIS after another
answer-chaining sequence
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.
T...
Winner is whoever has the shortest answer in bytes.
Example in C (118 bytes):
#include<stdlib.h>#include<stdio.h>
main(x,v)char**v;{srand(&x);x=atoi(v[1]);while(x>0)printf("%d ",x),x-=rand()%10;}
Recently this question caused a bit of a stir. The admitted goal of the challenge was to replace our old fibonacci question which the op felt was outdated.
The question was closed twice by high rep users holding code-golf badges, and reopened twice by regular users. It currently has two additi...
@cairdcoinheringaahing Actually that's easier than you might think, you can figure out a lot about Dennis if you look hard enough (like his thesis paper)
Recently this question caused a bit of a stir. The admitted goal of the challenge was to replace our old fibonacci question which the op felt was outdated.
The question was closed twice by high rep users holding code-golf badges, and reopened twice by regular users. It currently has two additi...
Basic rules (different then mine)
Story
It is the year 4579, humans now have 2 hands with 1001 fingers each. Chopsticks has become based off of points. And @Dennis has more rep the @Martin... Hand drawn red circles are now downvoted... Jon Skeet has hit 2 trillion rep on every SE site... Yeah s...
One OEIS after another
answer-chaining sequence
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.
T...
Winner is whoever has the shortest answer in bytes.
Example in C (118 bytes):
#include<stdlib.h>#include<stdio.h>
main(x,v)char**v;{srand(&x);x=atoi(v[1]);while(x>0)printf("%d ",x),x-=rand()%10;}
