« first day (4622 days earlier)      last day (77 days later) » 

1:00 AM
Sandbox posts last active a week ago: Digits of Infinity (computing A206636) code-golfmath
 
1:25 AM
CMC: Given an Array, return the minimum number of pair swaps required to sort it.
[2, 1] => 1, [3,2,1] => 2, [2,1,3] => 1
 
sum(i in 0..length, j in i+1..length, a[i]>a[j])
 
1:49 AM
@ATaco lots of golfing languages: 0 (assumes that the input array is already sorted)
Without the assumption it has a 50% success rate which is still pretty good
 
 
3 hours later…
4:41 AM
Petition to rename the base computer file size measurement unit to "chad"
so if something would previously be 4GB, it would now be 4 Giga Chads
 
125 millichad
 
5:45 AM
0
A: Sandbox for Proposed Challenges

BubblerI (rev)?(pal)? the source code, you (rev)?(pal)? the input! code-golf string source-layout Just because the reverse and palindrome were not too challenging individually :) Write a program (full program or function) that satisfies the following: given a string input, the program as-is outputs the...

 
^ not sure if it's interesting for others
 
 
2 hours later…
7:41 AM
@Bubbler looks fun :P
 
thanks :P
 
intuitively i'd recommend making the palindromization without repeating the middle character, but since the original challenge does repeat the middle character it's probably still most fitting to keep it that way
oh also keep the rip-off chain alive
 
8:22 AM
lol
 
9:08 AM
@lyxal noooo, i promise it's not that
there should be non-rickroll validators for youtube links
@SandboxPosts this is cool!
@Bubbler ^
 
9:21 AM
Not to flex or anything, but I just posted a miniscule 12kb code-golf answer
 
10:11 AM
0
Q: Do you win a Numeric Mahjong?

BubblerBackground Numeric Mahjong is a hypothetical variation of Japanese Mahjong, played with nonnegative integers instead of Mahjong tiles. Given a list of nonnegative integers, it is a winning hand if it satisfies the following: its length is \$3n+2\$ for some nonnegative integer \$n\$, and it can b...

 
 
1 hour later…
11:11 AM
hello all!
 
 
2 hours later…
1:15 PM
@RydwolfPrograms I know I have absolutely no experience outside C and Python, but I'm interested; has anyone got this yet?
 
 
2 hours later…
3:22 PM
Do gcc/clang have a way to execute the compiled program immediately? Like for Swift you have swift build to just compile or swift run to both compile and execute
 
3:39 PM
@emanresuA Ooh, yummy. I just made eggplant curry last night.
 
4:00 PM
@ais523 Oh goodness, that's obscure. How did you manage to figure it out?
@UnrelatedString Piet Mondrian, maybe (at any rate, the creator of Piet mentions that he would've called it Mondrian but the name was already taken by "a rather mundane-looking scripting language")
@lyxal Every apple contains Pip. However, it's not recommended to eat that part.
 
4:15 PM
@mousetail I just reread a novel (Up a Road Slowly) that features a character named Uncle Haskell. That was a bit strange.
 
The ignobel prizes are the best thing to happen to humanity
 
5:17 PM
@DLosc interesting, I didn't know "Haskell" was that common of a name
 
5:53 PM
I'm thinking of making a patch for long pronouns in the pronoun assistant...
 
 
1 hour later…
7:01 PM
CMQ is it possible to have no Friday the 13ths in a year?
 
don't think so
 
How come?
 
I guessed :p
 
7:34 PM
@DLosc oh yeah, of course
 
8:04 PM
What's the longest gap between Friday 13ths possible?
 
There are just 14 years, you could just try them all
 
14 years?
 
One starting with every day of the year and then a leap year and a normal version of each
 
@mousetail this is truth
 
@Simd CMC: Given a weekday and the day of the month, determine the longest gap possible.
 
8:20 PM
@mousetail nice!
@mathscat could be a challenge on main!
 
hmm yeah might be interesting
 
8:37 PM
Do you want to pose it?
 
you're free to do so
I just pointed out that your question could be presented as a challenge :p
 
 
2 hours later…
10:22 PM
CMC: given two lists of posints X and Y, remove the elements of Y from X by going "in order" through X and not skipping any elements of Y unless they arent present in X. Example incoming
X = [1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 10], Y = [1, 3, 7, 2, 4, 5, 6, 11] => [2, 4, 5, 1, 3, 10]
actually im wondering if it'd be better if you could just assume every element in Y is also a member of X
 
10:57 PM
incredibly shitty Jelly, 16 bytes: https://tio.run/##y0rNyan8///hrp2PNq57uLPJ7li7w6GlMVEPdyw6OjngUeMOt5OT0/7//2@oo2Cko2Cso2Cio2Cqo4DONQApAHLNweIQQTOguCEA
er
ẹⱮṂ>Ƈ@¥\ZḢœP⁸Fɓf
...wait
 

« first day (4622 days earlier)      last day (77 days later) »