1:16 AM
@cairdcoinheringaahing phew, managed to fix it

1:49 AM
@Neil One Punch Man theme plays

2:22 AM
@Neil As far as I can tell, that falls under my deadline less bounties for unanswered questions, so I’ll set one up for you when I wake up

2 hours later…
4:03 AM
0

You have to drive home, and that with an Uber cab. You have $20 in your pocket and you want to make the most out of it, by choosing the best ride for you. There are 5 options from least to most expensive, UberX, UberXL, UberPlus, UberBlack, UberSUV. Challenge Knowing the length of your ride in mi... 2 hours later… 5:42 AM 0 Your task is to save to write exactly 3 million lines of valid HTML. By "valid" I mean conforming to some established HTML specification, not just something that a browser will render. The specific content of the HTML and length of each line do not matter (as long as it's valid), and you can eith... @cairdcoinheringaahing you wrote this when you were asleep?! Hate when I accidentally fall out of my bed and land on my keyboard, typing perfectly coherent text related to the current conversation :p 5 2 hours later… 7:21 AM How do y'all with your fancy well established golfing languages get such decent string compression? Like seriously, how do some of these algorithms work? 8:14 AM @Lyxal Huffman coding is proven to be the best possible method to compress your data. But it generally depends on the type of your data and how you optimize it. For example, Stax uses a specialized Huffman coding that uses two-character frequencies instead of single-character frequencies. Stax's optimized Huffman coding can often reach the optimization levels of dictionary compression and base conversion under pure ASCII. It all depends on what distribution of words/chars/substrings you assume with your compression algorithm With certain choice, it can do better at certain category of strings, while doing worse on the others And we can analyze what category of strings are used more frequently for CGCC challenges overall (IIRC Dennis did the same with the frequency of Jelly built-ins used, swapping one-byte and two-byte built-ins and such) 9:17 AM @Razetime I’m just that good :P (Nah, I couldn’t sleep so decided to write it) 9:35 AM the legend of caird coinheringaahing is it bad that I've memorized that name 10:26 AM @cairdcoinheringaahing I can't deny that that didn't influence me, but I was surprised that it hadn't been answered, unlike the other unanswered questions, which didn't really interest me 1 hour later… 11:43 AM @Razetime no, you at least remembered it right Even though this has been discussed once before, I still read it as carid coinengineering Hell, I've barely memorised it I always thought it was German until I saw it was used by Dennis in an answer And I was like "hey so they must be German" Even though that's 100% factually incorrect Not German, although I can speak it Isn't it supposed to be close to code challenges? Also, you shouldn't have any more difficulties determining the difference between HN and my profile pictures I don't know if its "close", but it comes from the Jelly compressed strings on the "Programming Puzzles & Code Golf" challenge @Lyxal It's white on black, they're basically identical :P 11:49 AM But mine is no longer centred The ratio of black to white is no longer similar Also, one says frick whilst the other one doesn't Which is what I would say is the most major new difference If it doesn't have some kind of animal or (actual) person on it, all profile pictures are the same :P Ah I see I've confused brand new users with user202729 because they both have the default pfps :P Doesn't everybody? 12:03 PM slightly disappointed that nobody has called me out over the lame pun in my explanation though @Neil The "Is this a tile of two cities?" line? yup I think that just went straight over my head when I first read through it :/ Nice pun tho :P Any feedback? Considering posting in the next week if it looks good 1 hour later… 1:16 PM @cairdcoinheringaahing that's what a german would say 9 hours later… 9:50 PM 3 Here's an easy one, with just enough complexity to make golfing non-trivial. Input A list of non-negative numbers representing people waiting in line for Thanksgiving dessert. The first (leftmost) number is first in line, and the list can contain repeats (think of each number as a person's firs... 1 hour later… 10:52 PM 0 Multiply or Divide by n Here's a simple challenge. Given a positive integer \$n\$, output \$A076039(n)\$from the OEIS. That is, start with \$a(1)=1\$. Then for \$n>1\$:$\$a(n)=\left\{ \begin{array}{ll} n\cdot a(n-1), & \text{if } n>a(n-1) \\ \lfloor a(n-1)/n \rfloor, & \text{otherwise.}\end{arr...