00:00 - 18:0018:00 - 00:00
As our help center likes to put it:
All solutions to challenges should:
Correctly implement the required specification.
Be a serious contender for the winning criteria in use. For example, an entry to a code golf contest needs to be golfed, and an entry to a speed contest should mak...
Reverse Code Golf- Print out two by using variables a and b that both equal one and adding them without any extraneous lines.
Your task is very simple, display that 1+1=2, except you need as many commands and non extraneous lines as possible.
What counts as non-extraneous? If one cannot remove...
0
Originally posted (and deleted) by @Tlink, which was most likely inspired from this StackoverFlow question.
Since it was a shame it got deleted, because it seemed like a good challenge in general, I figured I'd repost it with proper formatting and rules. (I've tried contacting @Tlink and gave per...
0
A Notepad Celebration
Given a string consisting of printable ASCII plus line feeds (␊; LF; esc \n; hex 0A; dec 10) and carriage returns (␍; CR; esc \r; hex 0D; dec 13), display (by any means) how the printable characters would be positioned if printed on a printer which takes those two control c...
1
I love functional programming in Octave, but it's rather unwieldy in practice. I'm wondering about the shortest way to define an anonymous recursive function.
I have some ideas, but I'm wondering if there is a way to combine these ideas to make them even shorter (or equally short but more versat...
I'm working with the following function (it turns a wavelength into RGB values, based on this Fortran script):
const gamma = 0.8
var R, G, B;
if (wavelength >= 380 && wavelength <= 440){
attenuation = 0.3 + 0.7 * (wavelength - 380) / (440 - 380);
R = ((-(wavelength - 440) / (440 - 380))...
Haskell, 48 bytes
f n=1+6*sum[(mod(i+1)3-1)*div(n^2)i|i<-[1..n^2]]
Try it online!
Uses xnor's "black magic" formula:
A proof of its correctness, and an explanation of how xnor managed to express it in 43 bytes of Python, can be found here.
Long story short: we count Eise...
Find the minimum set of letters to buy
Imagine that you own a board like this:
which lets you write any message that you want, given that you have the letters for the message. Given that you have a list of messages that you want to switch between, find the minimum number of each letter that y...
00:00 - 18:0018:00 - 00:00
