As the top challenge asker, you should know by now the best way to do it is write trivial questions that get 5 answers in the first hour, so that it hit's the HNQ giving you more views and points.
Then by answer 300, you know it's a good challenge.
@HelkaHomba General algorithm's not too bad (shove everything on one column, fill base, move column, fill the base where the column was, repeat) but somehow I don't think that's going to beat way-too-slow BFS in golfitude :P
We have lots of challenges related to the OEIS (Online Encyclopedia of Integer Sequences).
Challenges that are integrated with the OEIS
Evolution of OEIS
Find the program that prints this integer sequence (Cops' thread)
Extending OEIS: Counting Diamond Tilings
Challenges that are about prod...
challenge idea: given a game tree (which lists the options for each stage, each of which either fails, wins, or goes to another stage), calculate the expected number of fails before winning.
Write a program or function with no input that prints or returns this string of 24-hour and 12-hour times:
00:00 12:00am
01:00 1:00am
02:00 2:00am
03:00 3:00am
04:00 4:00am
05:00 5:00am
06:00 6:00am
07:00 7:00am
08:00 8:00am
09:00 9:00am
10:00 10:00am
11:00 11:00am
12:00 12:00pm
13:00 ...
@Katenkyo Sometimes people are jerks. Sometimes people's cats/kids play with their phones/keyboards. Sometimes cosmic rays strike at just the wrong time.
New challenge type: If any bit in your program's memory is changed at any point during the program's execution, the program has an n% chance of still running normally.
It wouldn't be that hard to try every possible bit at every possible stage of the program for small programs, then calculate the n% chance of running normally, then using the 1-n% byte bonus.
There would have to be two copies of everything, including the CRC checker. And the CRC check would have to be performed often, and it would be very hard.
@MarsUltor Taking the required input, and giving the required output. It's OK if the program mashes itself up like a just-booted ROM, so long as it becomes stable again with the required memory values to execute properly.
Actually, it's completely fine whatever it does (except maybe waiting for an error in memory then reloading from source...)
And not just because that would make it "radiation dependent" code.
@wizzwizz4 I do not think this adulterates the message I was trying to get across.
Anonymous
@wizzwizz4 If you wanted to make a challenge based off of this idea, you'd need to define a specific task the program must accomplish (otherwise it'd be too broad), and it would need to be different enough from the radiation-hardened quine challenge.
@wizzwizz4 I don't think it would be a good challenge type, as the main part will always be the radiation hardening, the task to performis here to just say "here, it does something!"
Anonymous
8:10 AM
@wizzwizz4 Hmm, maybe. Perhaps post the proposal on meta and get comments/votes there?
fix show
Your task is given n, you must print first n character returned from Haskell expression fix show.
Let me explain how fix show produces the "magic" string.
show is just escaping the string and then add quote. Since the resulting string consists only double quotes and backslash, show th...
@Quill I once done a hackaton with my uni, it was a pretty bad experience, as most of the people who came, came before they could not go to the courses after the night of dev'ing
We were like 4 people working, and the 50 others were playing...
The 2016 european football (soccer in some countries) championship will begin in just a few days!
Your task is to write a program which guesses randomly the outcome of all games, and ultimately the winner of the championship.
Note: there are a lot of simplifications made in this challenge, espe...
Who needs to compare things case insensitively when you're able to generate every permutation of uppercase and lowercase? No one! That's the answer. No one does. Your task is to achieve this feat; generate all possible permutations of uppercase/lowercase for a given input.
Input
A string of pri...
Background
I have a bunch of old and grainy black-and-white images.
Some of them depict vines climbing on a wall, others don't – your task is to classify them for me.
Input and output
Your input is a rectangular 2D array of bits A, given in any convenient format.
It will not be empty, but it's...
Yes it is. You are correct. Call in an electrician.
We have lots of challenges related to the OEIS (Online Encyclopedia of Integer Sequences).
Challenges that are integrated with the OEIS
Evolution of OEIS
Find the program that prints this integer sequence (Cops' thread)
Extending OEIS: Counting Diamond Tilings
Challenges that are about prod...
Write a program or function with no input that prints or returns this string of 24-hour and 12-hour times:
00:00 12:00am
01:00 1:00am
02:00 2:00am
03:00 3:00am
04:00 4:00am
05:00 5:00am
06:00 6:00am
07:00 7:00am
08:00 8:00am
09:00 9:00am
10:00 10:00am
11:00 11:00am
12:00 12:00pm
13:00 ...
fix show
Your task is given n, you must print first n character returned from Haskell expression fix show.
Let me explain how fix show produces the "magic" string.
show is just escaping the string and then add quote. Since the resulting string consists only double quotes and backslash, show th...
The 2016 european football (soccer in some countries) championship will begin in just a few days!
Your task is to write a program which guesses randomly the outcome of all games, and ultimately the winner of the championship.
Note: there are a lot of simplifications made in this challenge, espe...
Who needs to compare things case insensitively when you're able to generate every permutation of uppercase and lowercase? No one! That's the answer. No one does. Your task is to achieve this feat; generate all possible permutations of uppercase/lowercase for a given input.
Input
A string of pri...
Background
I have a bunch of old and grainy black-and-white images.
Some of them depict vines climbing on a wall, others don't – your task is to classify them for me.
Input and output
Your input is a rectangular 2D array of bits A, given in any convenient format.
It will not be empty, but it's...
