« first day (4055 days earlier)      last day (805 days later) » 

12:43 AM
The Machine is being turned on in 3
2
1
ON
 
I think so
 
wait how come @GingerIndustries and @emanresuA both have ukranian flags
and lyxal as well lmao
 
because it's support for Ukraine given the recent Russian invasion
 
thx lyxal
 
12:56 AM
@DialFrost looks good
 
@lyxal thx guys ah ic
 
0
Q: Lexicographical sum

DialFrostFor a given number n, output an strictly decreasing array whose sum is n and its lexicographical order is the smallest for any possible outputs Smallest lexicographical order means that for or sum n=9 the following strictly decreasing arrays are possible: [[9],[8,1],[7,2],[6,3],[5,4],[6,2,1],[5,3...

 
@lyxal ok ur cheating
 
Sandbox posts last active a week ago: Flipping Burnt Pancakes, but Optimally!
 
lmao
 
1:00 AM
@DialFrost no, I'm just fast
 
XD
 
it helps that there exists an integer partition element in vyxal
 
+1 for insane speed
ah ic
 
does most of the work. The rest is just filtering
excellent ad:
I do love searching for {KeyWord:More Results}
just like I love searching for [hyperlink blocked]
 
lmao
 
1:05 AM
document.appendChild= forced adoption
 
@lyxal think it also helps that your integer partitions are nonincreasing to begin with
 
@UnrelatedString probably lol
 
The Machine is working very well
 
wat machine?
 
2 hours ago, by Ginger Industries
26 mins ago, by Ginger Industries
user image
 
1:09 AM
uhhhhhh
interesting
nice scissors btw
:D
 
Ginger scissor reveal
 
nice table too
issit like evening for u rn?
 
bruh wat time lol
the only problem is im out of ideas for challanges
:(
i have an idea
but its crappy
about binomial theorem
so like given an integer n, print this
my bad idk how to make it an image
issit a good idea but needs improvement or its dumb and prob get rejected?
 
the Machine in operation
 
1:23 AM
huh wat issit doing
 
would be a borderline dupe of our existing pascal's triangle challenges
 
i like how the scissors is in the eaxct same place
@UnrelatedString aw
 
You can probably figure it out if you look at the two images side by side
 
theres a nail there which i have no idea wats it doing
 
1:24 AM
that's a screwdriver
 
@UnrelatedString wat does borderline dupe mean?
 
It's being tested
 
oh lmaooo
how bout Series for e as an challenge
or something along the lines of that
 
because Vyxal has algebra built-ins
 
1:29 AM
? for which one the e one or the other one
yay 2700 is reached
 
@DialFrost binomial
 
oh
 
2:09 AM
0
A: Sandbox for Proposed Challenges

tshRandomly Rounding code-golf math integer random Input a decimal number, round it to integer. It randomly round up or round down based on its fractional part. For input 2.4, it has 60% probability round to 2, and 40% probability round to 3. For input 3.9, it has 10% probability round to 3, and 90...

 
2:24 AM
okay which one of you nerds accessed the vyxal repo from facebook?
 
3:16 AM
20
Q: Is it a pure word?

Ginger IndustriesIntroduction A pure word (or perfect word), as defined by me, is a word where the sum of the position in the alphabet of each letter in the word is perfectly divisible by the total length of the word. For example, abcb is a perfect word because 1 + 2 + 3 + 2 = 8, and 8 / 4 = 2. Your task Given a ...

 
3:41 AM
21
Q: Implement the hyperfactorial

NirvanaThe objective Given the non-negative integer \$n\$, output the value of the hyperfactorial \$H(n)\$. You don't have to worry about outputs exceeding your language's integer limit. Background The hyperfactorial is a variant of the factorial function. is defined as $$ H(n) = 1^{1} \cdot 2^{2} \cdot...

 
CMQ: How juic avocad?
 
You gotta try for at least thirtee minut
If you get no juic, just juic harder
 
Eventually you will get some juic
 
 
Try threatening it with a knife
 
3:47 AM
Am I doing it right?
I have avocad and I have juic
 
Dissolve the adovacad in acid
 
You're peer pressuring it, nice job
 
YES i beat @mathcat in rep
 
Swallow ir whole and then do situps
To juic an avdocado, you gotta think like an advocado. Ask yourself, WWAAD?
And then do that
 
@RadvylfPrograms Wheat Wizard Asked About Dave?
 
3:52 AM
why was an apple dead?
 
 
1 hour later…
5:03 AM
0
Q: NxM List Combination Closest to Target

drmosleyGiven a list of N lists, each containing M integers, and a separate list of M integers (target values), return a list of N scalars (integers with a value of 0 or more) that correspond to each list in the lists of lists, such that when each value in a list is multiplied by it's scalar, and the val...

 
5:38 AM
Gahh I hate the ender dragon
Turns out I can't mlg water to save my life
 
Literally, I'm guessing? :p
 
Yep :P
And it's so much more aggro than people make it appear.
 
Yeah. In videos it always looks so easy and then you're there and it's destroying your towers every 10s and stuff
 
Also, turns out it can destroy water source blocks
Which is why I'm currently punching through iron bars to get a new water bucket
 
Wait really? TIL
 
5:45 AM
(set up an ender chest)
This is bedrock, might not be able to in java
 
Ah, okay. Probably is a bedrock thing.
Hopefully Mojang manages to fix all these weird incompatibilities in the next like, decade.
 
Both ways :P
 
Crossplay but with Java-style servers and datapacks and redstone would be so nice
 
I want underwater redstone and easy speedbridging on Java
 
Both editions have a lot to learn from each other
 
5:48 AM
Yeah
At least there was a portal room this time...
In hindsight, I really should've put that feather falling IV book I can trade for on my boots
 
6:17 AM
i believe the enderdragon can delete everything except bedrock, obsidian, end stone, and maybe iron bars
 
@lyxal For this challenge, can we assume a smallish number of pages of tags?
 
6:33 AM
@DialFrost wth no
 
idk how many of you play online tetris here but i just got 3 back to back PC's in a live game (i got real lucky with the pieces, but still): jstris.jezevec10.com/replay/live/229328541
 
0
Q: Fill in the next numbers

pxegerGiven a list of integers, output a list where the \$ i \$th element of the list equals the first number in the input list which is \$ \ge i \$, until there are no such numbers. For example, if the input is: 2 3 5 7 11 then we "expand" the sequence out to show where the gaps are: _ 2 3 _ 5 _ 7 _ ...

 
6:48 AM
@emanresuA you can assume as many tags as would be on a regular request to a tags page
 
7:47 AM
As in, can you assume finite tag pages?
 
Yes
But you can't assume a set limit of tag pages
 
That's what I meant, oh well :P
 
Surprisingly there were no python answers when I answered.
 
@emanresuA @UnrelatedString I wouldn't often do this, but I downvoted both your answers because I don't think preparing answers to sandboxed challenges is a good idea
Jan 1, 2021 at 20:37, by pxeger
Is it considered bad form to prepare an answer to a challenge that's still in the Sandbox?
 
Sorry
 
8:03 AM
@pxeger I actually tried solving it while it was sandboxed, but I then used a different approach on your challenge that I hadn't come up with when it was still sandboxed
 
0
Q: Random Point from a 2D Donut Distribution

JitseA donut distribution (for lack of a better term) is a random distribution of points in a 2-dimensional plane, forming a donut-like shape. The distribution is defined by two parameters: the radius r and spread s, in which the distance to the origin follows a normal (Gaussian) distribution around r...

 
Trying to answer pxeger's thing in halfwit and I'm regretting making it so minimalistic
 
Is it just me, or when I click "an edit has been made to this post, click to reload", does the post not reload?
 
Click to reload?
 
oh, I guess it's intended, because it no longer says "click to reload"?
what's the point in that then
 
8:22 AM
Ugh I'm patching halfwit bugs and DSO's taking a couple of minutes to load
TIL that JS Array(number) doesn't work on bigints
 
it is pretty inconsistent that Array(x) makes [x], unless x is a number
 
Yeah
ಠ_ಠ I completely forgot to compile while loops
And pad the stack with zeroes
Imagine a language without syntax sugar
[3, 5] -> Array(Increment(Increment(Increment(Zero))),Increment(Increment(Increment(Increment(Increment(Zero))))))
 
8:42 AM
No, that would be
Cons(Succ(Succ(Succ(Zero))),Cons(Succ(Succ(Succ(Succ(Succ(Zero))))),Nil))
 
0
A: Fill in the next numbers

emanresu AHalfwit, 7.5 bytes MZ;RZMR[$ Try It Online! I think I made it too minimalistic... Explanation M ; # Map over each value... Z # Fill an array of length (itself) with (itself) R # Reduce by (taking two lists) Z # Zip M # For each pair... R # Reduce by...

user image
3
 
9:12 AM
im back i have arrived from school
@emanresuA bedrock ender dragon is the worst
you cant one cycle it ...
 
Thankfully I bought Infinity
 
9:26 AM
o/
 
@emanresuA Infinity of what
@emanresuA this just reminded me i'm making a lang
 
Infinity enchantment in minecraft
@UnrelatedString @RadvylfPrograms @GingerIndustries Are y'all ever going to reveal the answers to these?
Actually o/ now
 
9:44 AM
o/
 
@emanresuA what is an o/
 
10:25 AM
@SegFaultPlus4 it's a person waving
 
I think tabl is finally online with a working lang-- APL is back!
 
@AviFS You might want to have a look at /home/ec2-user/warning.txt
 
@Adám Haha, let me guess. You noticed that there's absolutely zero security?
 
Yeah.
 
It's a nice souvenir.
I think I'll keep it :p
 
10:39 AM
I can easily make your EC2 bill go up.
 
I checked and supposedly it doesn't go up. The worst thing that happens is that it crashes, as far as I understand. And then I have to go in and restart it.
So I was putting off the security for now.
It's charged per hour the instance is running, as far as I understand. Regardless of the load it runs.
 
@AviFS How about now?
 
@Adám How about now what?
 
I'm hammering the (virtual) processor.
 
I should add a logger to see what mischief you're up to.
That would have been fun.
I can check the AWS account.
You can't be hammering it too badly because the site is still running instantly for me.
 
10:42 AM
I'm also spilling infinite output into stderr…
 
When Vyxal was up and they messed around with that, it started going wayyy slower. But I don't even see a performance hit on my end.
I can log on though and see.
Yeah, I see you in the usage metrics, but the cost doesn't change. (It's still free.) I'm moving to DO asap though, because AWS scares me re: surprise bills.
 
Huh, my browser is getting hammered.
 
Interesting, mine isn't even a little bit. Can't tell you're doing anything.
Must be specific to your websocket.
I don't know how it compartmentalizes that well, but it must be. I'm unaffected. If you restart the page, you'll start a new connection and it should be speedy.
(And hopefully your damage will be undone when you close the connection, haha)
 
@AviFS But you can see my warning.txt, so I can clearly take over your machine and mine bitcoin, right?
 
Correct. And I can kill all running processes, or restart the instance, when I notice.
That's the plan, at least.
Security stuff is in the works.
 
10:55 AM
Oops. Does the site still work for you?
 
@Adám Did you notice the neat features, though? I'm adding langs to this interface, the idea being that the output (or relevant state) gets displayed on the right of the respective line, and gets updated dynamically as you write. APL is not quite as unique like this as others langs are, because it's a bit of a glorified repl in APL's case.
 
Yeah, it is a similar to bqnpad.mechanize.systems
 
But after defining variables and functions, and using them, if you change the variable/function, the output is instantly updated dynamically everywhere that the variable is used.
(The instant feedback alone is kinda fun.)
 
@AviFS How do you detect that?
 
But the main feature here for APL is the output being updated as relevant state is changed.
 
10:57 AM
var←'hi'
{var}¨1 2 3
var←'hello'
I'd love to experiment with it, but the site seems unresponsive.
 
@Adám Well, so... I don't. Not yet. For now, it's just brute force. But the interface is set up for it, and flexible enough to do it for any language, with a few lang-specific functions. It's so fast that the brute force doesn't seem to matter for demo-ing purposes.
@Adám Wait, actually?
You're right, you must have killed it after all.
Just a sec.
 
@AviFS Oh, you mean that you re-execute everything upon every keystroke?
 
Huh. That didn't work. Is it possible you really did break it?
 
I hope you have backups of your files.
 
Haha, did you do that on purpose?
I think you deleted the script that was running.
Alright, she's back up.
@Adám Right now, yes. But it's not just running it as one big file. Each line is sent over in a JSON object and run individually, with relevant metadata attached.
And when it gets a result back, only the output for the line it sent over is updated.
So every line is already being run and updated individually.
 
11:06 AM
Heh, you can create fun animations with
v←1
v←v+≢⎕dl.1
v←v+≢⎕dl.1
v←v+≢⎕dl.1
v←v+≢⎕dl.1
then change the 1 on the first line.
 
And it has a state key attached that it's sending over each time, though APL doesn't use it yet.
So, right now, it's just looping over every line, sending each individual line, and updating each individual line when it gets a response.
But if I changed the logic to only send over the current line, it would still work perfectly for APL.
 
@Adám that looks cool
 
@Adám delete all lines at once to have it loop infinitely with no text
 
So on every keystroke, it would only be running the current line.
 
What if the current line affects something that was defined above it?
 
11:09 AM
And only the output for the current line would change. (The output on the right is actually a list of divs, which are accessed individually.)
@Adám I want the logic to work so that everything only affects the stuff below it.
 
@AviFS ahem:
 
So the order matters, it's supposed to simulate actually running every line in a repl one by one.
 
a←2
(a←3),a
 
But then if you go back up and change a line above, then it'll trickle down to the lines below.
@Adám Um, I think you broke it again.
@Adám That's working as intended for me.
 
What result do you get?
 
11:13 AM
If you run each of those lines in the repl, you get the same thing.
2 ⋄ 3 2
But that's the same as you get in the repl.
Each line only affects the lines below.
But if you go up and change the value of a: a←42
Then you get 3 42 below
If you just mash the keyboard, you'll see them both changing in real time.
So you could also do:
f←{...}

f 3 4 5
f 1 0 0 1 0
f 45
And as you changed the function f, you'd see the outputs below change.
 
@AviFS Sure, but if you begin only re-running the second line, it'll result in 2 2
 
@Adám You mean 3 3?
 
Yes, sorry.
Because, as you type, (a←3) is executed, then adding ,a has a already set to 3.
 
@Adám True. That's a consequence of my lazy looping through every line, just for this first version.
 
Well, your lazy looping is correct. Line-and-downward execution would be confusing.
 
11:21 AM
@Adám Hmm, I'd have to think about it. I made this with simpler languages and constructs in mind.
 
guys
you know how there was a 2016, 2018, and 2020 mod election
 
So you're extrapolating to 2022?
 
I've never voted before
:(
 
For example, if I run:
a←3
a+1
2×a
I get 3 ⋄ 4 ⋄ 6
If I then change that to:
a←3
a+←1
2×a
I get 3 4 8
 
@SegFaultPlus4 In the years 1, 2, 3, 4, 5, 6, 7, ..., 1878, there were no lightbulbs. You can't just say that there will be no lightbulbs in 1879 because of past trends.
 
11:24 AM
Which is exactly the behavior I wanted.
 
@AviFS Sure, but how about:
a←1
a+←2
a×←3
This gives 9. Now change the a+←2 to a+←20
 
I should get 1⋄2⋄9 right?
 
@SegFaultPlus4 I think mod elections only happen if there's a need for new mods. 2016 was the first official mod election to establish moderacy, 2018 had 2 mod positions available because of resignations and 2020 had 3 mod positions available also because of resignations
 
@Adám That should work.
It gives 63.
 
Will the last line now give 21×3 or (9+20)×3?
 
11:26 AM
@Adám 21×3 is what I would want.
But you're right, that does mean I have to be a bit careful with how I implement the dynamic bit.
 
Yeah, I don't see how you can avoid re-executing from the very top.
 
I think that would just mean I have to run every line that modifies a when a is changed.
 
How do you know if a line modifies a?
 
The line that initializes a counts as modifying here.
 
Sure, but how do you detect if any other line modifies a?
 
11:28 AM
But I still wouldn't have to re-run any lines that just printed a/observed it, so long as they were above the modified line.
@Adám Yeah. TC makes that a bit hard, doesn't it :p
 
Not sure it is TC specifically, but it sounds hard.
 
But, in the case of APL, isn't it safe to do everything that matches a(.)?←.*
 
@lyxal oh ok
i was going to run
 
@AviFS And ⎕EX⎕C⊃⎕A
 
Yeah, that! I knew there'd be quad functions.
 
11:30 AM
@AviFS what even is a quad function
 
But by and large, for most langs I want to add, and most use cases, I wasn't expecting that part to be too hard.
 
@AviFS No quads in ⍎'a←0'
 
a function that takes (a, b, c, x) and returns ax^2 + bx + c
 
@SegFaultPlus4 apl.wiki/Quad_name
 
The lang-specific function would be one that took the modified line as input, and returned a list of regexes.
And every line that matched the regex would be re-run.
 
11:31 AM
@AviFS Uh, many languages will be hard to parse using regexes.
 
Wasn't planning on including such languages and expecting them to be full-featured.
For the most part, the langs that are hard to parse are the ones that are pretty efficient.
So I may never change them away from the brute force.
But this is really nice for a lot of slower esolang interpreters.
But I do think APL variable stuff is doable with regex. You don't lose anything by running too many lines. Only by running too few.
 
@Adám ok
 
So overeager patterns (false positives) are fine.
 
Of course. Just re-evaluate any line that matches ^.*$
 
Haha, or more like any line that contains, as a substring, the name of the variable.
 
11:35 AM
That, or any or or
 
It's pretty easy to tell if something is a user-defined name, or a primitive, in APL :p
 
in around 20 mins, i made a simple non TC stack based language that can add and subtract numbers only lol
 
@Adám Also an option.
 
@AviFS No, you need both. But how do you avoid changes to things that shouldn't be changed?
 
@Adám Did you ever put multiple of the same variable/func, and then mash buttons at the top to watch them all instantly change?
It's quite satisfying, and shockingly instantaneous.
 
11:38 AM
Not mash, but I did do that animation thing.
 
... Assuming being in Europe doesn't make your connection to a US West server noticeably slower.
@Adám Oh yeah, I have to check that out.
But please mash!
Just once :p
 
@AviFS What will you do if I change the a←2 line in:
b←3
a←2
a b+←1
 
@Adám Woahhhh, that's super neat!!
 
If you don't execute a b+←1 then the a part will be wrong. If you do execute it, the b part will be wrong.
So you have to detect that the line also modifies b, then go back and include all lines that affect b.
 
@Adám Given Dyalog's speed, the line-based approach doesn't seem necessary any time soon, but when I do, it seems like it fits in the same boat, no?
 
11:41 AM
@AviFS What do you mean by "the same boat"?
 
@Adám Right, so this is where the first step would be to just rerun all lines that include "a" or "b" on the left hand side of a
 
And which variable does ⎕EX⎕UCS 64+?26 affect?
 
... that I have no idea.
Got some reading up to do.
 
@AviFS isn't the only way to assign.
 
I know, that was a short hand.
 
11:43 AM
@AviFS That's correct. It erases a random variable from among AZ
 
@Adám The step before that is to rerun all lines that include the name of the variable anywhere as a substring.
But that approach doesn't work for randomness.
 
Or indeed from computed names.
 
So, assuming one wants to optimize this, it should fit within the same framework. The function you define has an additional case (if statement) and anything like that with unpredictable effects would return your fave ^.*$
I'd actually give that functions access to the lines as well, and I'd return a list of line numbers to re-run.
That's how I think I'd do it.
So they could use regexes for some parts, substrings for others, or whatever they wanted. I'd just expect a list of numbers to loop over.
So in this case, it'd just return the list [0 .. input.length-1]
Which is what I'm doing every time for now in APL. (Other langs are much easier and more important to do this for, like slow interpreted stack-based esolangs with a short list, often only one, of easily parseable assignment primitives.)
Or in brainfuck, where the state is just a tape and a pointer index, so that gets passed back and forth each time.
And a representation of the state gets printed on each line to the right.
 
wait, when was APL invented
 
We'll see if this is still up in the morning, haha
And we'll take another look at my bill :p
 
11:51 AM
Which is shorter, 256-wrap or 257-wrap brainfuck Hello World?
 
@SegFaultPlus4 Before computers.
As a mathematical notation devised by Ken Iverson.
 
@SegFaultPlus4 It was a gradual process throughout the '50s and '60s.
 
It turns out 1957 is not before computers...
Oh just one other thing. Incidentally, it turns out to be a delightful interface for mobile. It's the first time I've ever been able to play with APL on my iPhone.
 
How do you type APL glyphs?
 
(Not because the iPhone bit matters, but because I know there's lots of neat stuff for Android.)
@Adám I found an app that lets you make custom iOS keyboards, so I'm playing with that. And you also have the in-browser bookmark thing, which is a start.
 
11:58 AM
•ᴗ•
 
@AviFS Ooh custom iOS kbds sounds interesting.
 
@GingerIndustries ••o
 
@lyxal birdo
 
I do not like birds
do not mention them
 
@Adám Right?! I'll be happy to share as I go.
 

« first day (4055 days earlier)      last day (805 days later) »