The Nineteenth Byte

« first day (3277 days earlier) ← previous day next day → last day (1863 days later) »

New Sandboxed Posts

03:12

Choose unconsecutive files code-golf string Given a positive integer and a file-clicking sequence, provide the files resulted from the process. (I hope there isn't a formula for this.) Sample 1Shift 2--- 3Ctrl 4 5Ctrl 6 Selects files 1-3 and 5. The input would be like 1S3C5C The code shou...

3 hours later…

ngn

05:46

Jono 2906

06:00

@ngn that's one big ol' railway track.

ngn

@Jono2906 one's big, the other even bigger :) unfortunately the text gives that away

El'endia Starman

06:53

That's hilarious.

Jono 2906

07:38

Interesting Challenge Idea number 3531: I delete the source code, you delete the input (file)

3 hours later…

Krzysztof Szewczyk

10:17

@Adám are J answers a subject of APL bounty too :P?

Adám

11:11

@KrzysztofSzewczyk No. While it is maybe hard to define exactly what constitutes an APL, it basically means a language with multi-dimensional arrays (this rules out K) and non-ASCII symbols (this rules out J) for built-ins.

@KrzysztofSzewczyk That said, if you know J, it should be fairly easy to pick up APL.

5 hours later…

Deadcode

15:53

Yay, I finally did it! Beat the best-scoring Morse-codeword-length answer using the dictionary approach.

2 hours later…

New Meta Posts

17:43

Q: Can I use here my own language for code-golfing?

Can I golf in my own programming language here? I ask it 'cause there is no online way to check it out.

Anush

hi all.. simple question... a comment to this question says use zstd -9 --long=28 test300.bin
(https://unix.stackexchange.com/questions/562818/is-there-a-compression-tool-with-an-arbitrarily-large-dictionary) but I get Incorrect parameters

Anush

18:08

found the solution.. upgrade:)

on another note, this is a truly amazing answer codegolf.stackexchange.com/a/198190/9207 . It should be nominated for a prize already

4 hours later…

Neil

22:05

@Deadcode so if I've understood correctly, you convert all of the dictionary to Morse, then looping over the input, you find those words that could be prefixes of the remaining input, select the correct word by means of an internal list of values, then output that word and consume the input and repeat?

ngn

22:16

@DJMcMayhem @El'endiaStarman could you grant chat.stackexchange.com/users/442063/user679683 write access to chat.stackexchange.com/rooms/90748/the-k-tree please?

El'endia Starman

@ngn Done. :)

ngn

thank you!

Deadcode

23:04

@Neil Yes, that's exactly right.

I'm wondering if I should move some of the dictionary-initializing logic from the header to the code. Namely, passing the short and long individually to it, rather than concatenating them in the header. Also wondering whether the code should have to be the one to convert it to lowercase. What do you think?

If a golfing language provided direct access to a dictionary that's divided into a "short" and "long" section, would it give a choice as to what form it'd be in, or just provide it in the simplest way and leave it to the program to concatenate or merge them?

And even if it gave a choice as to what form to take the dictionary in, that'd take one or two bytes to specify, I would think.

Probably one extra, because one is already taken referring to the dictionary by variable name.