« first day (3456 days earlier)      last day (23 days later) » 

1:19 AM
0
A: Sandbox for Proposed Challenges

Dannyu NDosContinuous Everywhere, Differentiable Nowhere Objective Build any function \$f : \mathbb{R} → \mathbb{R}\$ that is continuous everywhere, but differentiable nowhere. Format Using floating-point number is permitted. Though it will be preferred to use a datatype that is able to represent arbitrary ...

 
1:43 AM
0
A: Sandbox for Proposed Challenges

Ad Hoc Garf HunterMy phone number (which I will not be sharing here) has a neat property where there is a two digit number, which when iteratively removed from my phone number will eventually remove all the digits. For example if my phone number were abaababbab Then by repeatedly removing ab we would eventually ...

 
 
4 hours later…
5:27 AM
@AviFS 15:30-17:00 UK time allows the American west coast to get up (07:30-09:00) while those in Korea and Japan can participate if they really want (00:30-02:00). I guess it should really be slightly earlier: those in LA could get up at six while it is unreasonable to begin at 01:30 in Sidney, but programmers tend to be night owls rather than early risers.
@AviFS Yes: the room is almost dead, so statistics are useless. Compare the average weekly message count of 192 to the Orchard's 1.8k. That's an order of magnitude!
 
 
1 hour later…
6:47 AM
1
Q: Are These Scores Possible?

fireflame241Background In the sport of Table Tennis (aka Ping-Pong or Whiff Whaff), two opponents play a sequence of rounds, where each round consists of players hitting a ball back and forth until one player (may or may not be the server) gains a point. Table Tennis has some official rules that make for a g...

 
 
2 hours later…
8:44 AM
Any feedback for this?
 
 
3 hours later…
11:59 AM
@Bubbler Very clear and not very hard.
 
12:23 PM
chat anyone?
 
chat anyone?
 
asdf
Hi crazy GitHub person
 
fdsa
nosrep buHtiG yzarc iH
 
Third-party 'Chef' = tac confirmed
 
I installed tac in my brain, no idea how I got it.
 
12:31 PM
I installed howdyworld in my brain, no idea how I got it.
Howdy world!
 
!dlrow ydwoH
 
Howdy world!
 
My brain's tac is faster for world...
 
Howdy world!
 
@HighlyRadioactive You put it inside an infinite loop.
 
12:34 PM
yeah
Ctrl-C
I'm okay now
Can someone PLEASE do something with the 1+ page and 1+/Snippets?
For those too lazy to enter "esolangs.org"
The OMG meme seems a bit out of fashion though
 
TASKKILL /IM HOWDYWORLD.exe
Whoops! I'm on Linux
@HighlyRadioactive Ahh! Generate every random smash of the keyboard. Add that as an example program here!
Since it's extremely hard for a reasonable person to come up with, all of these example programs should be grouped in the Legendary category.
@HighlyRadioactive I am the lazy version of esolangs.org
@HighlyRadioactive GMO: Great Madness Opposite
@HighlyRadioactive Making an esolang called "PLEASE"...
@HighlyRadioactive Well, you should use Ctrl-D, that's common sense
3
A: Sandbox for Proposed Challenges

Third-party 'Chef'When does hh:mm = mm.ss? code-golf time restricted-time Let's begin with a thought experiment. You have a clock and a timer, in which you start the timer when the clock shows exactly hh:mm.00. Clock: The clock employs 24-hour time. So the range of hh is 0<=h<23. (Because 23 inputs are unsolvable...

Any feedback for this?
 
1:54 PM
0
A: Sandbox for Proposed Challenges

RosLuPFind the max string in common with MN908947.3 We must write a function that has as input two strings s1 and s2 and a positive number n and returns as output all the substrings common to the two strings of length greater than or equal to n or the empty list if there are none. The output of the fun...

 
2:34 PM
ideas on golfing this tiny program?
#define z m[4]
a[9999],*m=a;main(){for(m[2]=z=1;z;){for(;z;putchar(6[m-=3]+48));for(putchar(10);m[7];m[2]=z,z=1){z+=3[m+=3]-1;if(9<(m[3]=m[2]+=m[3]))++m[5],m[7]=1,m[3]-=10;}}}
I wanted to make a SMS-able, multiprecision fibonacci sequence calculator
it's 175 bytes and I doubt I can get it down further
 
Use Ruby :D
 
C makes this task interesting :p
#define z m[4]
a[9999],*m=a;main(){for(m[2]=z=1;;){for(;z;putchar(6[m-=3]+48));for(putchar(10);m[7];m[2]=z,z=1){z+=3[m+=3]-1;if(9<(m[3]=m[2]+=m[3]))++m[5],m[7]=1,m[3]-=10;}}}
174, not much of an improvement
 
3:15 PM
#define A[m]
a[9999],*m=a;main(){2 A=4 A=1;for(;4 A;putchar(6[m-=3]+48));for(putchar(10);7 A;2 A=4 A,4 A=1){4 A+=3[m+=3]-1;if(9<(3 A=2 A+=3 A))++5 A,7 A=1,3 A-=10;}main();}
172, with evil main() recursion
 
3:57 PM
@KrzysztofSzewczyk i believe putchar(10) = puts("")
i assume #define A[m] makes 2 A get treated as A[2]?
 
4:57 PM
1
Q: Writing erasable code

Ad Hoc Garf HunterMy phone number (which I will not be sharing here) has a neat property where there is a two digit number, which when iteratively removed from my phone number will eventually remove all the digits. For example if my phone number were abaababbab Then by repeatedly removing ab we would eventually ...

 
5:15 PM
I've had to make a tiny fix
#define A m]
a[9999],*m=a;main(){for(2[A=4[A=1;;){for(;4[A;putchar(6[m-=3]+48));for(puts("");7[A;2[A=4[A,4[A=1){4[A+=3[m+=3]-1;if(9<(3[A=2[A+=3[A))++5[A,7[A=1,3[A-=10;}}}
171
in fact, I may have a 169 too:
#define A m]
a[9999],*m=a;main(){for(2[A=4[A=1;;){for(;4[A;putchar(6[m-=3]+48));for(puts("");7[A;2[A=4[A,4[A=1)if(4[A+=3[m+=3]-1,9<(3[A=2[A+=3[A))++5[A,7[A=1,3[A-=10;}}
 
@user41805 2 A becomes 2[m] = m[2], but we know what you meant
 
 
5 hours later…
10:15 PM
1
Q: Count The Genus

Dannyu NDosObjective Given a matrix of connected box drawing characters, count its genus, the number of plane sections it encloses. Valid input The box drawing characters are ─│┌┐└┘├┤┬┴┼╴╵╶╷ (U+2500 U+2502 U+250C U+2510 U+2514 U+2518 U+251C U+2524 U+252C U+2534 U+253C U+2574 U+2575 U+2576 U+2577). The matri...

 

« first day (3456 days earlier)      last day (23 days later) »