The Nineteenth Byte

Wezl

00:00

@user is this a metaphor or am I about to explain why vanilla is the best flavor of all?

tjjfvi

Has anyone else noticed that the stack exchange icon in the top bar is switching between going to stackexchange.com and giving the community dropdown?

Jo King

@rak1507 You can terminate in an error for -2 tio.run/##S8sszvj/38DQKs/KQbvaUNeq1krHQO////@6Zf9NAQ

rak1507

nice

what's the shortest you've got

Wezl

@tjjfvi I think the top bar is just links until all their javascript runs

tjjfvi

Ah, that seems to be it, thanks

user

00:05

@Wezl It's a metaphor, but you're entitled to your opinion. I just meant that having different variants of a language is a good thing :P

Wezl

I don't consider the existence of chocolate ice cream a good thing :P

user

Then you owe us chocolate eaters a great debt since we're ridding the world of it :P

But more seriously, what are some major differences between ><> and Befunge? @fishypeople

Wezl

btw it's pronounced phish not fish :P

lyxal

mirrors, registers, replacement of the kinda clunky horizontal and vertical ifs with a conditional and unconditional jump etc

tjjfvi

^

lyxal

00:09

also, substacks

tjjfvi

Data storage is done on a stack of stacks

user

@Wezl Oh I thought it was ghoti

@tjjfvi That sounds difficult

Jo King

better stack manipulation. Befunge is stuck with the top two elements constantly

user

Oh yeah

Doesn't Befunge have a way to get the nth element of the stack? Because it sounds pretty useless otherwise

Wezl

oh does ghoti even have set/get commands for program manipulation?

Jo King

00:11

yes, p/g same as befunge

Wezl

rats

Jo King

@user I don't think so, you have to make do with a lot of the aforementioned p/g

@rak1507 I don't think i have one shorter than that

Wezl

befunge 98 also has a stack stack

Jo King

><> also has that with []

Niko

@NewPosts replace 1111 with 1000-1 and -11 with 0-1 and 1-1 with 1 should get us a non-adjacent form no matter what?

replace 1*n =>1+0*(n-1)+-1

Jo King

00:15

><>MC: Print the positive divisors of the input

Niko

also -1*n => -1+0*(n-1)+1

tjjfvi

15 bytes for fib

Jo King

nice! i thought the reverse trick might be useful

rak1507

@JoKing "tupni eht fo srosivid evitisop eht"o75*0.

user

@rak1507 Wow, how original and funny 😆

rak1507

00:21

lol

tjjfvi

@JoKing Does it have to terminate?

Jo King

i'm going to go with yes, though not necessarily cleanly

also, separators please

tjjfvi

Does it have to be 1,5 or can it be 1,,,,5?

What separators are allowed?

rak1507

><>MC: print the lyrics to 12 days of christmas in under 441 bytes :P

Jo King

any non numeric separator, and let's say you can have multiple between each sure

lyxal

00:30

@JoKing i&1::&:&$%?!n1+' 'o:&:&)?;20.

rak1507

too much registering

Jo King

oof yeah. simple counters can often be replaced by looking at the stack length instead

Though i suppose that breaks the ?!n part

DLosc

@JoKing 30 bytes :P

tjjfvi

Is participation from non-learners ok, or should I hold off?

lyxal

@rak1507 hehe overreliance on implicit input and input wrapping goes brrr

Wezl

00:36

@JoKing I got

<input number>  01.
 : &v        >:naov
:?!;>:&:&$%?!^    >1-

Jo King

@tjjfvi Maybe post the byte count and hold off on the actual code for now

tjjfvi

@Wezl You can assume the input number is on the stack

In TIO pass -v 123 as args

Wezl

@tjjfvi yeah so the main code is after the first line

@Wezl can I get some help with my conditional? It shouldn't need two lines

tjjfvi

Tip: ao outputs a newline and is shorter than " "o

DLosc

@DLosc 27 bytes

Jo King

00:40

The simplest golfing tip is to remove whitespace, and you can usually remove all but a couple of spaces from a ><> program if you structure it right

user

By making it as horizontal as possible?

Nitrodon

25 bytes

tjjfvi

@Wezl If you reduce your condition to just a single character (in this case n), it can be inline. If you do that, you need to make the other commands unconditional and mitigate their effects on the rest of the code; in this case, you can leave junk on the stack, and you're allowed to have multiple separators, which makes it easier

Jo King

A lot of my programs have a structure to them

......?\

oh no, my mobile keyboard doesn't have a newline key

tjjfvi

main..?\
ing....\some branch

Nitrodon

00:44

```

Bubbler

I got 22 for divisors

tjjfvi

I got 23, or 22 with a hack

Jo King

i have 19 or 20 with proper termination

Bubbler

Huh, my 22 ends with fishy

DLosc

I find myself really wishing this were one of the stack-based languages that autopushes the input when there aren't enough arguments on the stack :P

Jo King

00:47

Basically every line is a loop with possible jumps to other loops (or just a jump to the next at the end anyway)

lyxal

@DLosc relateable

Jo King

just checking, mine uses -v. i think it's 21 with i

Bubbler

I use -v input too

DLosc

@DLosc 25 bytes with extra delimiters

Jo King

another tip is to begin lines with mirrors, so they can be in the above format but each line can be of any length

Wezl

00:58

gn

Jo King

see you!

OldSandboxPosts

Sandbox posts last active a week ago: Multiple Averages

Jo King

Alright, guess it's time to post: 19 bytes

Bubbler

Damn, I knew l was a thing, but had no idea how to keep stack height across a conditional

tjjfvi

Here's my hacky 20 byte solution (it outputs a whole ton of trailing newlines, but does eventually terminate)

Bubbler

01:04

I'm way too spoiled with Gol><>

This was my 22

Nitrodon

```
/:l2-:n=?;ao
/l&::&%?!
```

Bubbler

No triple backticks here

tjjfvi

@tjjfvi (It loops until n/i is 0, i.e. when floats run out of precision)

Gotta start with 4 spaces

Nitrodon

/:l2-:n=?;ao
/l&::&%?!

Jo King

@Bubbler Oh interesting, filtering them out then printing

Nitrodon

01:07

If you don't mind never terminating, that goes down to 17 bytes.

Jo King

><>MC: Write an solution to this question (i'm too lazy to think up a problem myself)

DLosc

01:21

@DLosc 24 bytes

Jo King

you don't need the last !

DLosc

wha...

Oh wow, that's weird.

Okay.

In that case, this is 22

Jo King

try starting the program with <

DLosc

How do you mean?

Oh, you mean have all the control flow going RTL so the switch to the second line can be closer to the left end?

Jo King

yup, saves on whitespace at the cost of a <. If you still needed to only do an extra : at the start, you could do :<

DLosc

01:39

@tjjfvi So... this was a very good tip. 15 bytes

Nitrodon

@JoKing 36 bytes because I'm bad

What's this "Learn you a lang" thing anyway?

Browncat Programs

It's a new chat event we're trying out

We vote on a language, and CMCs related to it will be posted, along with people who know the language helping out with teaching people about it

Jo King

@Nitrodon Oof. I don't think you need to necessarily take in all the input for this challenge

Nitrodon

yeah, you're right

@JoKing 22 bytes

Not sure what I was thinking there.

Jo King

02:01

well done! you can golf the "!"- part to b%, but the other part is shorter than what i was going for

Nitrodon

oh, nice

20 bytes with b%

DLosc

@JoKing 24 bytes

Bubbler

02:17

@JoKing 18

Independently developed but same strategy as nitrodon's, and further optimized after seeing b%

Nitrodon

That's a beautiful +3=.

tjjfvi

02:41

@DLosc Wow, nice

DLosc

03:00

Pip has finally officially graduated to version 1! :D

Browncat Programs

Nice!

I don't know much at all about Pip, I guess this is a great opportunity to learn!

Funnily enough I also used to have a project pre-code-golf called pip that was a recursive acronym where I wasn't sure what it actually should stand for :p

Wasn't related to language development though

DLosc

@BrowncatPrograms An even better opportunity will be once pxeger and I get it on ATO. That's what I'm going to work on next. :)

@BrowncatPrograms "Great minds" etc. etc.

Browncat Programs

@DLosc And once I finish RTO I'll try to include Pip in the first release, ETA a few decades :p

DLosc

Perfect! Well, if that's your goal, maybe you should go ahead and learn it from the command-line. ;)

Browncat Programs

Ooh, I really like Pip's assignment syntax, unary compound assignment operators seem really neat

Razetime

03:25

@DLosc how nice

DLosc

@BrowncatPrograms @Razetime Thanks!

Browncat Programs

I'm definitely going to try answering in Pip tomorrow

Unfortunately I know the docs will be blocked on school wifi, but I'll print them to PDFs or something tonight

Razetime

i've left a lot of easy qquestions to answer in pip

but dlosc might have answered them :P

he usually jumps on some regex questions

DLosc

I'm not as active on the site as some of y'all, so I'm sure there's plenty to answer. Seems like every time I search for answers posted in Pip, I come across an answer from Razetime from last year on a question I didn't know existed. ;)

Razetime

03:41

xP

and then you proceed to halve the byte count

emanresu A

How is LY(X)AL going?

DLosc

@emanresuA We ><>ed a bit

emanresu A

Cool

DLosc

I somehow outgolfed everybody on the divisors challenge, even though there's like four people here who are way better at ><> than me

("Somehow" = "by combining multiple hints from said better-than-me ><> golfers")

emanresu A

04:01

Any feedback?

Bubbler

Looks fine to me

hyper-neutrino

friendly reminder that ><> is a palindrome

5

Razetime

along horizontal axis

hyper-neutrino

well no just if you don't flip characters "><>".reverse() is still "><>"

emanresu A

04:50

@lyxal What's up with lyxal.pythonanywhere.com?flags=&code=5%201w%E1%B8%8A&in…?

lyxal

wdym?

pVC aecidiospore adduced

wait is lyal going on?

Unrelated String

ye

pVC aecidiospore adduced

so the language is ><>?

Bubbler

05:06

yes

Razetime

><> is quite fun

pVC aecidiospore adduced

i dont see anything in the pinned messages

like LYXAL: Welcome to Lea......

Razetime

tbh there should be

pVC aecidiospore adduced

><> is an infinite loop

so fish loops around the code

whoa google got a dark theme

01>+::v
  ^oan<

Bubbler

05:21

It doesn't look like fibonacci

pVC aecidiospore adduced

@Bubbler because it isnt

i made a simple push entire input to stack

>i:01-=?v
     ><~<

Jo King

><>MC: Write a FizzBuzz shorter than 63 bytes. The shortest over on code.golf is 49, so it shouldn't be too hard right??

emanresu A

06:04

@lyxal Nvm I got mixed up.

Bubbler

@JoKing Golfed from 103 to 71 but looks like a wrong path :P

68

Jo King

06:25

i'll note the 49 is a three line program too

pVC aecidiospore adduced

07:52

in Dinoux Room, 10 mins ago, by pVC aecidiospore adduced

annd the parser is done (i think)

^ progress

Bubbler

Totally weird 66

Jo King

08:15

heh, that BuzziF is clever

Bubbler

CMP: FizzuB or BuzziF?

Jo King

i believe my brainfuck solution has "BuziF"

Gareth

09:42

@tjjfvi In retrospect something like shortest solutions to my test cases would have been a better scoring criterion, but it didn't occur to me at the time. Once it was posted though, I wouldn't have changed it to anything else. Seems unfair to move the goalposts once people could possibly be working on a solution.

New Posts

10:05

0

Q: Minesweeper Speedrun with limited acceleration

Given a \$200*200\$ mine area, reveal all non-mine's. You're given a mouse. Your mouse's acceleration shouldn't go over \$10^{-5}\$ cell/ms, and you can only click every 100ms. In formula, if the trace of your mouse is \$\left(x_i,y_i\right)\$ and \$c_i\$ is 1 if you clicked in the millisecond, ...

code-challenge

emanresu A

11:08

The Sandbox isn't very welcoming to poorly-explained / incomplete questions.

To prove my point:

pVC aecidiospore adduced

Is there a nice program that fetches the most used atoms from Jelly, 05AB1E and Vyxal?

lyxal

11:25

It's called a corpus

And yes

There's one for all three languages you mentioned

Ask caird about the jelly corpus

I'll run one for vyxal later tonight

And I have no clue if the 05ab1e program is still available anywhere

Because iirc, 2x-1 did the 05ab1e corpus

emanresu A

@lyxal github.com/Adriandmen/05AB1E/issues/182

'night

Aaron Miller

12:14

@lyxal Try it Online!

Browncat Programs

12:43

@cairdcoinheringaahing How does Jelly (presumably) handle this?

I'd think at least one byte would always be needed to signal the end of the function part

Whether that's } in stack langs or a chain separator

(But idk, maybe there's some sort of tacit weirdness)

Also, morning!

pVC aecidiospore adduced

@lyxal i have seen them before, but aren't they just showing the most commonly used diagraphs/triagraphs

lyxal

correct

@BrowncatPrograms good morning to you ;)

pVC aecidiospore adduced

@lyxal and i am asking for the most commonly used commands

time for me to go learn some data science

lyxal

very cool

pVC aecidiospore adduced

what does data.stackexchange use? sql?

Razetime

12:55

yes

caird coinheringaahing

13:24

@BrowncatPrograms It uses a quick to group up to 4 links together, or, if you have more links, you can use a chain, or a separate link (line link, not atom/quick link)

As an aside, I really dislike whoever came up with the link and link terminology in Jelly :/

Browncat Programs

@pVCaecidiosporeadduced I can send you a list of Vyxal answers as JSON if you want

@cairdcoinheringaahing Seems like it still costs a byte, right? So basically just a fancy version of <blah>...}

caird coinheringaahing

@BrowncatPrograms Yes, but it's much more flexible

Browncat Programs

I suppose you could do something like that in a stack based language, too

I wish pushing a function wasn't so costly, because it's definitely the most elegant solution

caird coinheringaahing

The one I really dislike (from a golfing POV) is pushing a function object to the stack

If your builtins are mainly functional programming ones (e.g. S combinator), then fair enough. But otherwise, it's always better to use <blah>...}

Browncat Programs

If most of the functions have a defined number or pattern of operators, you could get away with something that would group them into a function costing only one byte, but you'd still have the issue of really long functions costing two bytes for the {...}

The terminating } feels really inelegant, maybe I'd like it more if it was something like | or ;

caird coinheringaahing

13:38

Ooh, Husk is now at the top of the ELO rankings

In fact, the only change in the top 6 is Husk and Jelly swapping

Browncat Programs

Speaking of ELO, I should really finish my own language ranking system

caird coinheringaahing

@BrowncatPrograms I thought you'd say that if I mentioned the ELO rankings :P

Wheat Wizard

I should learn an golfing language so I can tank its ELO.

caird coinheringaahing

@WheatWizard That's the best part! You don't have to actually know the language to tank it, just post your long, convoluted learner programs :P

Browncat Programs

Oh, didn't notice infosec got a sponsor

When'd that happen?

Oh, the announcement's only been viewed 69 times

nice

caird coinheringaahing

13:43

Every time I look at the ELO rankings, I'm always shocked at how high Pushy is, before remembering that the guy who made/uses it only really answers with it if the answers are short :P

Browncat Programs

That's the biggest issue with ELO rankings, and one that might be difficult to address unfortunately

caird coinheringaahing

The best way to fix it is to get more users to use a language

Of course, that's an entirely different can of worms :P

Browncat Programs

13:59

Parsing headers is going to be one of the biggest improvements in mine, since the current ELO script doesn't seem to be very reliable at it

Bubbler

14:39

APL: 1525 -> 1580

That's quite a big jump

pVC aecidiospore adduced

whats ELO?

@BrowncatPrograms well ok

@Bubbler for this; desmos has sliders that can increment wihout halting

Browncat Programs

@pVCaecidiosporeadduced It's a ranking system typically used for chess players, but someone made a script that ranks languages' golfiness with ELO

@pVCaecidiosporeadduced I'll upload it to a gist, just a minute

user41805

15:00

someone rickrolled anagol golf.shinh.org/p.rb?Golf+Spoilers+Inside

Browncat Programs

@pVCaecidiosporeadduced gist.github.com/RedwolfPrograms/…

It's just a file containing a JSON string on each line

You may want to filter out comments and strings with some parsing

pVC aecidiospore adduced

ok thanks

how did you generate it btw?

user41805

<input type=image src=1 onerror="document.location='https://shattereddisk.github.io/rickroll/rickroll.mp4'"></input>

Browncat Programs

@pVCaecidiosporeadduced I wrote a SEDE query to grab all of the answers with "Vyxal" in the header, then I just took the first <pre><code>'s contents

Sandbox Posts

15:44

0

A: Sandbox for Proposed Challenges

code-golf An or A? Your challenge is to input a noun, then see if there should be an a or an in front of it. (e. g A airplane is incorrect because airplane starts with an vowel. An airplane, however, is correct.) Your program should be case insensitive (computer and CoMpUtER are the same) Tests: ...

Anush

what's the fastest code out there to factor a 128-bit number?

Browncat Programs

Well, if you've got plenty of memory, a lookup table :p

Anush

factorint from sympy is very slow for 4931640575209645979080224463818370832 for example

@BrowncatPrograms that's more than the number of particles in the known universe :)

Browncat Programs

@Anush Well yeah, factoring's not exactly known to be a quick operation for big numbers :p

If it was, we wouldn't use RSA

Anush

sure but 128 bits should be easy at least for smart code

no one uses 128 bit RSA

Browncat Programs

15:54

Yeah, because what's considered slow for crypto is much, much different from everyday stuff

Anush

@BrowncatPrograms "factor" on the command line takes 15 seconds

I wonder if there is any faster code

Browncat Programs

Just a sec, I'll go grab my quantum computer

3

pxeger

@Anush it's probably possible to multiplex it on several cores

Anush

if it takes 15 seconds for my PC you don't need a quantum computer

pxeger

you said you wanted it faster!

Anush

15:57

@pxeger interesting thanks. I just don't know what the state of the art code is for that problem size

@pxeger I do!

Browncat Programs

I doubt there's anything too much faster, aside from small optimizations in the implementation

If there's any faster algorithm for factorizing large integers on classical computers, we would have found it already

Anush

I think I found something

pari seems much faster

pxeger

the implementation of factor

I don't imagine speed is that big a concern for factor though

m90

This book (found in a reference in the Wikipedia article on 'Integer factorization') says that algorithms in the "first category", which includes the Pollard-Brent rho algorithm (which is what factor uses), "are extremely effective at finding divisors of less than 20 digits" (which corresponds to ~66 bits).

Anush

pari seems to be less than 40ms for all the 128 bit integers I have tested

factor is pretty fast usually but sometimes a lot slower

Browncat Programs

16:02

Might be using something like elliptic curve

Anush

Factor any remaining composite part using the Pollard-Brent rho
algorithm

that seems to be what it is doing

Browncat Programs

I'm talking about pari not factor

What do you need to factor 128b integers for anyway?

Anush

3

A: Fastest semiprime factorization

Pari/GP, 0.21s factor(input()) Pari/GP seems to be slightly more performant in this task than Mathmatica. Try it online!

Aaron Miller

> to generate a truly random string, put a web developer in front of Vim and tell them to exit.

3

Anush

looks like we need an SIQS implementation added!

the definitive answer to my question is msieve it seems

Browncat Programs

16:19

What's up with the language-design tag? Its wiki says it should be used for questions asking for answers to be languages, but it's been used on several questions asking for tips on language design

Should we create a second tag for the tips for language design?

I might bring this up on meta

pxeger

It's no different to python, don't you think? That's for either: challenges that specifically require python answers, or tips questions about python

Browncat Programs

Hmm, true. If so, it might make sense to edit the wiki to clarify that.

caird coinheringaahing

I see it to be a tag where the central part of the question is about designing a language, whether that's a tips question, or a challenge

Browncat Programs

I'll clarify the tag wiki

caird coinheringaahing

Make sure you get rid of the "should be supplemented with [...] popularity-contest" bit :/

Browncat Programs

16:24

Will do

Edited, feel free to make any improvements you think are necessary

caird coinheringaahing

> But you guys know things I have never ever heard about like "Fish" or "R" or "Whitespace" or some kind of crazy things

> R
crazy things

(source)

Browncat Programs

We finally have an answer

@user The term "lolify" means to make something LOL. Just a funny thing that occurred to me. Doesn't have anything to do with the base conversion. — André Diego Piske 9 hours ago

For the excerpt, can you reject and edit it?

I'm at a nice multiple of ten

(If that's possible)

DLosc

@BrowncatPrograms lol

pxeger

16:45

@BrowncatPrograms "reject and edit" isn't an option for me (because I don't have the rep to edit tag wikis on my own?)

Browncat Programs

Aw :(

I guess just say it looks ok

caird coinheringaahing

Just go downvote 2 answers :P

Browncat Programs

finds list of pxeger's answers

:p

caird coinheringaahing

@pxeger Also, yes, that's the case. Improve Edit and Reject and Edit only exist if you have the ability to edit tag wikis without approval (so 20k+ rep)

It's a bit of a weird thing tbh

pxeger

the 20k rep is very strange, and more strange that I can review them without that privilege

hyper-neutrino

16:47

i mean, i can go reject it and re-edit it manually if you really want :p (I don't think i should actually do that but technically i can)

Browncat Programs

Nah, it's fine :p

caird coinheringaahing

@hyper-neutrino Wait, can you override reviews?

hyper-neutrino

yes

when i go to codegolf.stackexchange.com/review/suggested-edits/61900, there's a "reject edit" button

idk if it will prompt me to confirm if i do click it so i won't :p

caird coinheringaahing

¯\_(ツ)_/¯ If there was ever a chance where no one would be mad at you for doing so, it's now :P

hyper-neutrino

you raise a fair point :p but idk if it invalidates you and pxeger's review progress

caird coinheringaahing

16:54

Huh, can't find anything about it on MSE

DLosc

Thinking about the wording now... is there ever a place on this site for a tips question about designing non-golfing languages? Probably not practical ones, but maybe some category of esolangs?

caird coinheringaahing

I suppose that, by the same metric that code-golf tips language-design is a legitimate tagging "group", a question about designing a fast language would be on topic, per fastest-code tips language-design

New Posts

0

Q: So is that maximum?

There's a multi in one out function. Given some inputs and their outputs, check if it's possible that the function outputs the maximum of inputs on some(maybe one) fixed positions. Sample Input: [1,2,3] => 2 [2,1,3] => 2 [3,2,1] => 3 Sample Output: true (maximum of pos 1 and pos 2) Sample Input...

code-golf function

pxeger

@NewPosts anyone else not understand this?

caird coinheringaahing

I thought I did, until the third test case

hyper-neutrino

17:03

i think i get what it's asking but mostly based on the test cases, not cuz the explanation is actually sensible

pxeger

yeah I've worked it out now

hyper-neutrino

it's just "given a bunch of arrays of the same size and an output for each, determine if there is a set of indices such that the output is the maximum of the elements at those indices for each pair of input-output"

New Posts

0

Q: English An or A?

Your challenge is to input a noun, then see if there should be an a or an in front of it. (e. g A airplane is incorrect because airplane starts with a vowel. An airplane, however, is correct.) Your program should be case insensitive (computer and CoMpUtER are the same) Tests: airplane: an water: ...

code-golf text-processing

tjjfvi

17:29

@Gareth Yeah, that makes sense

caird coinheringaahing

17:40

I like it when the devs explain a bug fix

Browncat Programs

TIL De Morgan's law has a name

caird coinheringaahing

@NewPosts @CVers, I've edited a bit to make it clearer, think it should be ok to retract close votes

DLosc

@BrowncatPrograms Discrete Mathematics FTW

Browncat Programs

Who sniped my suggested edit review >:|

caird coinheringaahing

Me :P

Browncat Programs

17:49

Can someone copy and paste the code from this TIO link

caird coinheringaahing

s=>/^[aeiou]/i.test(s)?"an":"a"

Browncat Programs

Thanks

hyper-neutrino

@cairdcoinheringaahing I believe this works for the max function problem but I'm not exactly too sure what yours is doing

should i post it or is it too trivial of a modification, in which case you should just take it as a golf?

caird coinheringaahing

Oh right, cause J...ị is a no-op :/

hyper-neutrino

lol

oh i see now how yours works. yeah you should just use this as a golf :p

caird coinheringaahing

17:56

@hyper-neutrino Up to you, tbh

@hyper-neutrino Sure, will do :)

hyper-neutrino

i got a bit confused by that part but now that i look at it i literally just removed the no-op from your program :p i would've had it first but i had to bike home from uni first so i missed my chance lol

my almost 2-week no-activity* streak continues
* as in new posts

caird coinheringaahing

I think I can remove the Ḋ

hyper-neutrino

doubt

actually... maybe.

i want to say no because of an edge case involving 0 but 0 != [0] so that might work

caird coinheringaahing

Because Ṁ€€ gives [] for an empty list, which the input will never be

DLosc

@BrowncatPrograms Hey look, an easy challenge to solve in Pip! ;)

hyper-neutrino

18:01

@cairdcoinheringaahing ah. well that should work then, nice. i was just worried about the 0 edge case with max of empty, but looks like that isn't a concern since it's wrapped in an each

New Posts

0

Q: Question too similar

so some years ago I asked this question. I made it clear that leaving a double h lefter from a "sh" or "SH" becoming "thh" or "Thh" was acceptable. But now I'm older and wiser, I would like to ask it again but this time not allow for these double "hh"s. My two questions are: Is this too similar ...

discussion specific-question questions

Browncat Programs

@DLosc I forgot to make a copy of the docs last night :/

DLosc

rip :/

Well, I'll leave it alone till you have a chance to try it anyway.

caird coinheringaahing

:D Just hit +20k rep earned this year

Browncat Programs

Nice!

caird coinheringaahing

18:11

I've 1640 rep away from earning half my total rep in this year alone O.o

hyper-neutrino

oo my rep is a palindrome

Browncat Programs

I'm making a programming language that compiles to brainfuck, and it's not very golfy it seems

[<<]>>[+>>]+>>[-]>[-],<<<[<<]>>[+>>]+>>[-]>[-],[<<+>>-][-]<<<[-<<]>>[>>]>.[-]<<<[-<<]>>[>>]>

That adds two numbers :p

hyper-neutrino

lol wut D:

i've only earned like a quarter of my rep this year (counting only net rep, ignoring things like bounties and whatever)

New Posts

0

Q: Written Word Equation

Word Equations Word equation, but not as you know it! Given a sentence which will include two numbers, numerically, and a spelt operator, in the order seen in the examples, your goal is to give the numerical answer The operators will be spelt as: "add", "minus", "times" and "divide" Any real numb...

string math number

caird coinheringaahing

3 on-topic questions in an hour O.o

Browncat Programs

18:56

Is it just me or have the "review queue empty" messages not been showing up

caird coinheringaahing

It's a known bug, status-planned

Browncat Programs

Ah, ko

*ok

Transcript for