« first day (4794 days earlier)      last day (346 days later) » 

lyxal
lyxal
00:01
@NewPosts everywhere I go I see it
there's no escaping Balatro
emanresu A
emanresu A
0
A: Interpret brainfuck

emanresu AExceptionally, 292 bytes {0C}r{c?!1!14G}cG+r}i{0}p}q}fR}t}s{""}o{1F}u{t:29999?{t;~0;}t:q}k{c:p?{o;P;/A}d{f>0?!11{d=91?!3{f+1}f=93?!3{f-1}f{0}d{q}l{d=43?!3{k+1}k{d=44?!7{i:0A}k{i[1}i=45?!3{k-1}k{d=46?!6{kC}y{o+y}o{d=62?!3{q+1}q{d=91?!8{k=0?!3{1}f!3{s~p}s=93?!7{s:u-1}p{s]u}s=60?!3{q-1}q{k%256}k{t[l...

I guess it's TC now
Neil
Neil
00:57
CMC: Output 140 digits of pi, but then get the 140th digit wrong.
OldSandboxPosts
OldSandboxPosts
Sandbox posts last active a week ago: Rotation by triple skewing, Create a cactus from words
lyxal
lyxal
01:28
@Neil Vyxal, 39 bits2, 4.875 bytes: ki⁺(Ḟ (vyncoded)
Not counting the 3 as a digit of pi
New Posts
New Posts
01:40
0
Q: Evaluate Ternary Logic

Dannyu NDosObjective Given an expression involving ternary values, evaluate it into a ternary value. Ternary Values The three truth values in question are the values of Haskell's Ordering, namely LT, EQ, and GT. They stand for "less-than", "equal-to", and "greater-than", respectively. Furthermore, they them...

code-golf logic-gates combinatory-logic
Bubbler
Bubbler
01:56
J, 12 bytes, missing decimal point: >[email protected]^141
ceiling of pi times 10^141
Unrelated String
Unrelated String
02:19
@lyxal reminds me of that exhibition fight where one guy was a boxer and the other guy wasn't so for some reason they had asymmetrical rules where the boxer competed with boxing rules so the other guy just went on his back and kept kicking him for the whole match with zero chance of a counterattack
 
1 hour later…
New Posts
New Posts
03:26
0
Q: Situations when recursion helps

l4m2Recursion is actually quite powerful, sometimes its doesn't look like that child problem of itself exist, but recursion is just helpful. One case per answer.

tips recursion
 
1 hour later…
hyper-neutrino
hyper-neutrino
04:30
@NewPosts I wonder how arbitrary the input format can be, because I feel like most languages can solve this using eval lmao
Bubbler
Bubbler
05:07
I guess the intent is mainly about defining the four functions given
hyper-neutrino
hyper-neutrino
the thing is in vyxal they're all one byte except <> is two, and defining LT, EQ, and GT as -1, 0, and 1 and taking in reverse polish notation, the solution becomes 1 byte
I'm working on a version that doesn't use eval at all but it's honestly not going to be an interesting solution, I'm just doing it to justify to myself that I can post my answer lol
math scat
math scat
06:08
@Neil haha
classic parker pi
emanresu A
emanresu A
07:04
@OlivierDulac: yeah, seriously. If an arbitrary amount of mouse work is allowed, just middle-click to paste, or bring up a right-click context menu to copy and paste. I assumed when reading at first that the entire textbox was the "selection" copied by control-c, since that's the only thing plausible with just a keyboard without having hit any shift-arrow keys or even ctrl-a. Being able to select precisely 24 characters somehow, for the same time cost as hitting a or ctrl-v is total nonsense. This needs a new title and framing to make any sense as an application of this math problem. — Peter Cordes 1 min ago
Some people really don't seem to get the concept of simplified challenges
Neil
Neil
@lyxal yes, that's fine. extra brownie points if you can make the last digit 6
@Bubbler I'd prefer the decimal point to be there sorry
Mukundan314
Mukundan314
07:27
@emanresuA, I've observed that the instruction at the jump's target is ignored since the ip updates post-jump. If this isn't intentional, would you mind addressing this possible bug? On the flip side, if it's by design, a little update to the readme would be great. I'm leaning towards seeing it as a feature, not a bug, especially after managing to squeeze out an 81-byte "Hello, World!" using this behavior. Kinda proud of that, honestly!
emanresu A
emanresu A
08:02
Nice! I'm amazed you've reduced it this far, and I suspect even more reduction's possible in certain sections with leading spaces. When I was creating positionally, I hadn't tried to use it for anything complex and was just trying to add useful builtins, which is why I didn't really test stuff like multiple IPs (probably useless for golf) / global stack / jump/skip stuff. I'll go update the README, since I don't particularly want to break existing stuff
 
1 hour later…
Newly Featured Posts
Newly Featured Posts
09:10
5
Q: Tips for shortening this type-safe addition in JavaScript

Felix SchönherrConsider: c=(a,b)=>(+a||0)+(+b||0) Yes, it is not good to solve it like that. But I want to shorten it even more. If a is a string and b is a string, then return 0. If one is a number, return it (floats and intergers). And if both inputs are numbers, then return the sum (if either string can be ...

code-golf tips javascript
emanresu A
emanresu A
09:52
Random (main site) event idea that I had a few months ago and forgot: Find 30ish obscure/semiesoteric langs and schedule one per UTC day for some month, with bounty rewards for posting any (non-trivial) answer in the day's language on X different days
4
Simd
Simd
10:13
hello!
 
3 hours later…
Seggan
Seggan
12:47
@mathscat hey, to their credit, they got further than 11 lol
l4m2
l4m2
13:23
@NewPosts I remember there's code .sort(f=(x,y)=>y?f(x)-f(y):...,
Neil
Neil
huh, D(n) == 2 ** (n - n * F(n) // (D(n) + F(n))) - 1 for all decremented powers of 2 up to n for all n up to 7, but it doesn't work for n=8. (F = Fibonacci.)
Seggan
Seggan
13:39
@emanresuA like LYAL + LotM?
math scat
math scat
14:01
@Seggan true true
 
4 hours later…
emanresu A
emanresu A
17:50
@Seggan Yeah, pretty much, but more casual - you can just show up on a day and post an answer, and with enough answers you'll get some form of bounty. Currently I'm thinking +100 per 3 answers, aggregated into one or two bounties at the end of the month
mousetail
mousetail
A bounty for tips or just might also be a nice addition. Often a few tips or other help are needed before people feel confident to golf in a new language
DLosc
DLosc
@emanresuA I agree, but also wontfix. In order to make it less annoying, there'd need to be either explicit line numbers or labels, which a) complicate the syntax and b) require extra work for the interpreter to calculate which label corresponds to which actual line. Exceptionally is "hey, here's a funny idea I can build an esolang around real quick"... user-friendliness isn't a big priority. :P
emanresu A
emanresu A
Yeah, fair. I'm considering writing a slightly different version that compiles into exceptionally and also has static gotos and labels
(labels get ignored and are only used for jump targets, gotos are replaced with relative jumps)
DLosc
DLosc
Ah, nice xD
It is funny in your BF interpreter how often it looks like there's matched pairs of curly braces, when in reality that's not how the language works at all
emanresu A
emanresu A
Yeah, although usually when you load something you're preparing to store it later
The [] (all four of them) are also balanced actually
DLosc
DLosc
18:26
Have you tried running (a stripped-down version of) the prime numbers example code from the challenge? I get no output, and it ends on "item": lambda x, y: x[y], with IndexError: string index out of range.
emanresu A
emanresu A
You might want to try that again, I just fixed a bug that made it break after 30000 iterations
DLosc
DLosc
Still doesn't work on the new version
I think the old version sometimes threw a different error at that point, which is probably what you fixed ;P
emanresu A
emanresu A
What I fixed was that after 30000 iters I was indexing into 0 instead of indexing into the tape
Normally it should crash by zero division caused by indexerror
DLosc
DLosc 
The BF code I'm using:
>++++++++[<++++++++>-]<++++++++++++++++.[-]>++++++++++[<++++++++++>-]<++++++++++++++.[-]>++++++++++[<++++++++++>-]<+++++.[-]>++++++++++[<++++++++++>-]<+++++++++.[-]>++++++++++[<++++++++++>-]<+.[-]>++++++++++[<++++++++++>-]<+++++++++++++++.[-]>+++++[<+++++>-]<+++++++.[-]>++++++++++[<++++++++++>-]<+++++++++++++++++.[-]>++++++++++[<++++++++++>-]<++++++++++++.[-]>+++++[<+++++>-]<+++++++.[-]>++++++++++[<++++++++++>-]<++++++++++++++++.[-]>++++++++++[<++++++++++>-]<+++++++++++.[-]>+++++++[<+++++++>-]<+++++++++.[-]>+++++[<+++++>-]<+++++++.[-]+[->,----------[<+>---------------…
It works in this Julia solution at least
emanresu A
emanresu A
Might be a difference in EOF handling?
Ah, I see, that code uses a trailing newline to end the number. That's probably the reason, mine appends a null byte to the input
DLosc
DLosc
18:34
Hmm
Oh, and it wouldn't work for me to just add a newline in the ATO input box because it just reads one line and then appends a null byte to it
emanresu A
emanresu A
Replace the 0 at the start with 10 and it might work
For me it timed out with 255
I don't know whether there's a bug or whether it's just that slow
DLosc
DLosc
Aha! It timed out with 8, but it worked with 2.
emanresu A
emanresu A
Yeah just got that
DLosc
DLosc
Just That Slow™
(I dunno if you meant change the Exceptionally code, but I changed the BF code)
emanresu A
emanresu A
I changed the exceptionally code to append newline instead of null
user image
\o/
There are a few optimisations I could make. The most expensive part of the code by far is updating the tape, and I could change it to not do that when unnecessary, and RLE long runs of +s and -s
DLosc
DLosc
18:43
Yes, but code golf!
6
 
2 hours later…
New Posts
New Posts
20:26
0
Q: Argument of a complex number (Cops)

CrSb0001This is the cop's thread, where one should post the scrambled code. Here is the robbers' thread where the cracked source should be posted and linked to the cop's answer. Task: Write the shortest safe program that given two inputs \$x,y\$, outputs \$\arg(x+iy)\$, where \$\arg(z)\$ is defined as t...

code-golf math cops-and-robbers calculus
0
Q: Argument of a complex number (Robbers)

CrSb0001Task: Crack the scrambled code for calculating the argument of a complex number \$z=x+iy\$ given two inputs. You must post a comment in the cops’ thread with a link to your working source, mentioning clearly that you have cracked it. In your answer’s title, you must include a link to the original...

code-golf math cops-and-robbers calculus
DLosc
DLosc
21:00
@DLosc We used to have a meme of Success Kid with a caption like "Code won't complete before the heat death of the universe.... Saved 1 byte." I just spent an embarrassing amount of time trying to find it, but all I found was this one, which I'm pretty sure isn't the original:
Jan 3, 2016 at 21:43, by Doᴡɴɢᴏᴀᴛ
user image

« first day (4794 days earlier)      last day (346 days later) »