The Nineteenth Byte

« first day (3006 days earlier) ← previous day next day → last day (2133 days later) »

MilkyWay90

02:29

https://tio.run/##3VXfb9owEH4mf4XnaUqypQFCm1EkXvpQae97YxEy4QC3iZPZTgtF/O3sbBIIdFqn7m0IKfb9/HL33aXc6FUhBsNS7vc8Lwupidoopz5yoUpItYOiUIGWkFZS8UJkPOfaM9KcrRV/Ad9ZVCLVqFJkTCYudwN37iaOBAXyCeZWqIs7pgA1shLTUhZLyXK8pUVeZrCePrGMz92AFpUuKz3NGRc0cZyP5A6y4pk0CYhmjyDIQhY5WWldqlG3qzRLH4snkAu0DDFgl3WjYRzHUTTo3sbX0bDfd5w5LMgBgyeCGT6iePxdVuCPnA5fEEHGY9LDc0eCrqQglDodBIPYzel5xTMgwuiN8AtK2SzFmMsVf3jMclGUP6XS1dPzevNCJ4J8IlGcYNxDJgKZApKupCc@RTexj2EE6XbHaHRhg1qngYCZJqPRVT@x4M8q5SktuVga8LUxyzKPE1GYvpGDliwKSbi5N53wmZjXlij9wyt4ftCPBtc38dfhbY8e49RZLZ5WpzwuzBHN8qCRm4uBt8yKGcuIMbOFPpmailNRTK2EmtLyJupBVeUzkFbRgTWkHi0xu/Z…

This code feels very yucky for some reason

I sort of hacked it together with execs and formats

MilkyWay90

02:51

https://tio.run/##tVbfj9o4EH4mf4XPVZWEywYSILddiZc@VOp732iETDDgbmLnbIddivjbt2MngcDulrtti0DY8@ubzHz2pNzpjeCj21I@PbGiFFIjtVNOs2RclTTTDohCRbWkWSUVEzxnBdNe3O@PopvId1YVzzSIFZqimcvcwF26qSOponJLl1aoxUeiKGhkxeelFGtJCthloihz@jjfkpwt3QCLSpeVnheEcZw6zjv0kebiAbUASJN7ytFKigJttC7V3WCgNMnuxZbKFViGEHBABvFtkiRxPBp8SMbxbRQ5zpKuUJ2Dx4MF/MXJ9IusqH/n9NgKcTSdoiGse5LqSnKEsdODZCB3s3rYsJwibvRG@DdIySKDmOsN@3afF1yU/0qlq@3D4@47nnH0HsVJCnFrJERzRVG2kR5/H08SH8JwNBhMwejCBrROmwIgze7ubqLUJn9WKU9pyfjaJN8Ykzz3GOLC9AzVWrQSEjGzbzvhE75sLEH6k0fw/CCKR@NJ8s/thyE@xmlQbT6dTnmMmyWYFUErNxuT3joXC5IjY2YLfTI1FcdczK0Em9KyNmqtqooFlVbRo48083A…

If this program works...

7 hours later…

user202729

09:43

@Anush Find array with max average is easy as well. Binary search for the result, then for each candidate subtract every element by it and check if there's any subarray with positive sum.

Anush

10:07

@user202729 Hi.. Sorry I am not sure exactly which puzzle you are replying to

@user202729 the one that is foxing me is the following. We are given an array of integers and we want to output max sum(subarray)/sqrt(length of subarray)

@user202729 can we solve it in subquadratic time?

Anush

10:21

@user202729 if you just want to max average you only need to find the largest element.

2 hours later…

New Main Posts

12:42

Q: Map values to any multidimensional array

Codegolf challenge - mapping values in a multidimensional array [ [0, 0, 0], [0, 0, 0], [0, 0, 0] ] This 2D array is sick of being so false, and wants to find the truth about life, once and for all. Your task is to write a map function that takes any multidimensional array and creates a ...

Adám

13:13

Whoa, I just noticed SO has an asking wizard. This would be perfect (heavily customised, of course) for PPCG.

Skidsdev

@Adám wow, it would. I wonder if the mods could talk to SE about that posibility

Adám

Imagine if those sections had the main parts of a good PPCG challenge: Brief task description and wining criteria, Exact rules and restrictions (if any), Walked-through example case, Test cases…

Veskah

PPCG Askng Wzrd: "Just make another quine variant, bro"

New Sandboxed Posts

13:41

A: Sandbox for Proposed Challenges

Words Everywhere Given a list of words, output a square grid of characters, so that all the words can be read from the grid, by moving horizontally, vertically, or diagonally between characters, without reusing characters in the same word. Example B A D R E T E Y E The above grid contains th...

1 hour later…

DJMcMayhem

14:57

@Adám Absolutely

That was my thought when I saw it too

Jo King

15:19

@bb94 yeah, it happens every now and then. no idea what causes it

2 hours later…

Anonymous

17:02

@Skidsdev Posting it as a request/suggestion on meta would probably be the most effective way to propose it

moonheart08

A few days ago, i had a rather silly idea: A self hosting JIT VM. The VM first sets up the initial version of itself while running on a interpreter, jumping into the JIT compiled version of itself once done, which handles executing the user code.

Now i wanna implement it. This means I need to roll my own programming language to write the VM in in the first place. Anyone know a good, preferrably free, book/site on language design?

New Sandboxed Posts

A: Sandbox for Proposed Challenges

Word Changer Reachability code-golf string decision-problem Word changer is a game where you are trying to turn one word into another via single-character edits, with each step being its own word. For this challenge, edits may be replacements, insertions, or deletions. For example, WINNER → L...

Skidsdev

17:35

@moonheart08 then the JIT compiled version of itself JIT compiles itself and jumps into that

Also can't you just pick a language that has both interpreted and JIT options? Like Lua?

moonheart08

17:48

@Skidsdev The goal of the idea is to get rid of the call barrier between the JIT/VM and the code it's executing. So the JIT/VM executes itself. The interpreter is simply used to bootstrap everything, by allowing the JIT/VM to make an initial JIT compilation of itself.

also it'll never end up running itself recursively, the version of the JIT/VM that's been compiled is given all the pointers/data/etc needed to handle executing itself without another layer.

it's given all the data about itself, i.e. pointers to the buffers containing the JIT'd code, type data, etc, when it's called.

from there the VM just treats itself like any other code, optimizing it using profiling data as necessary, inlining things, etc.

due to the design, it's allow the JIT/VM to also optimize calls between the user code and itself, as it treats them identically.

it has no distinction between it's own code and the user code.

moonheart08

18:07

And of course, due to the requirement of being able to manipulate native types, Lua isn't really an option. (I don't like Lua anyways.)

1 hour later…

New Main Posts

19:08

Q: All ASCII characters with a given bit count

(Title with thanks to @ChasBrown) Sandbox The Background This challenge is inspired by a question that I recently posted on Puzzling Stack Exchange. Please feel free to follow the link if you are interested in the original question. If not then I won't bore you with the details here. The Fac...

code-golf

1 hour later…

bb94

20:36

@JoKing I can't access it at all

oh wait, now I can access it

Lynn

20:55

Golf language popularity over time:

Maybe "answers per month" is a little too fine-grained / noisy

DJMcMayhem

The most interesting trend is how "answers per month" has gone down in every language.

Lynn

The methodology isn't perfect; I think it fails to capture a lot of the old GolfScript answers that don't follow the now-classic <h1>GolfScript, 23 bytes</h1> format (which is what I based the SEDE query on)

select Name, year(p.CreationDate) as Year, month(p.CreationDate) as Month, count(*)
  from Posts p cross join (values
    ('Jelly'),
    ('GolfScript'),
    ('CJam'),
    ('Pyth'),
    ('05AB1E'),
    ('Japt'),
    ('Charcoal'),
    ('MATL'),
    ('Husk')
  ) as Language(Name)
  where (p.Body like '<h1%>' + Name + '[<,]%')
  group by Name, year(p.CreationDate), month(p.CreationDate)

2 hours later…

MilkyWay90

22:40

@Lynn Jelly will rule!

I think you should include answers like #ProgLang, n bytes

And things like # [Python 3.8 (pre-release)], 2754 bytes

because that's the format for TIO

Because I'm guessing that spike in Jelly is because one user used Jelly a lot in that specific format

Blue

It would be cool if it included every language that had that format

MilkyWay90

@Blue The graph would look like noise

Blue

As a answer percentage thing it could look interesting

MilkyWay90

@Blue Maybe

Blue

And most languages would be near 0

MilkyWay90

22:48

Do you know SQL

*SE Querying

Then you can make it yourself

Blue

A bit of SQL?

Well yeah

MilkyWay90

Yeah I guess so

Blue

I think there's already an image out there that was done a while back

MilkyWay90

@Blue We need more recent results

And compare them to old results

Blue

Well the languages used has definitely changed a bit

MilkyWay90

22:51

Yeah

MilkyWay90

23:01

@Lynn data.stackexchange.com/codegolf/query/1036940/…

That's what I'm doing

select Name, year(p.CreationDate) as Year, month(p.CreationDate) as Month, count(*)
  from Posts p cross join (values
    ('Jelly'),
    ('GolfScript'),
    ('CJam'),
    ('Pyth'),
    ('05AB1E'),
    ('Japt'),
    ('Charcoal'),
    ('MATL'),
    ('Husk')
  ) as Language(Name)
  where (SUBSTRING(p.Body,0,CHARINDEX(char(10),p.Body)) like '%'+Name+'%')
  group by Name, year(p.CreationDate), month(p.CreationDate)

MilkyWay90

23:23

I updated the query so it doesn't allow C++ to be included while searching for C

« first day (3006 days earlier) ← previous day next day → last day (2133 days later) »

all rooms