The Nineteenth Byte

See that is the advantage of blind worms, they can still use all those single socks, where the other one has been eaten by the washing machine monster.

Esolanging Fruit

Anonymous

11:14 PM

@EsolangingFruit 9/10 no fish taco

flawr

omg, you should definitely google penguin socks, cuteness overload!

Anonymous

@flawr I saw some at the store yesterday. My wife wanted to get them for me, but they were sized for womens medium, and my feet are considerably larger than that :P

flawr

oh no, now your feet are going to freeze!

CMS: does anyone here have a calculator with RPN?

ATaco

I have RProgN :D

Try it online!

Esolanging Fruit

If we're allowing esolangs now...

CJam: 1 1.0 1e10 / + 1e10 #

(# is exponentiation)

ATaco

11:22 PM

1 1.0 1e10 / + 1e10 ^ works in RProgN for the same effect.

flawr

@ATaco I think many stack based languages are basically using suffix notation, right?

Zacharý

@flawr what???

ATaco

Stack based languages usually implicitely use Post-fix (Reverse Polish)

There are a handful of exceptions, but that's normally done intentionally.

@flawr The term you're looking for is Post-fix Notation.

flawr

I mean otherwise the stack doesn't make a lot of sense.

ATaco

As I said, there are a few exceptions.

flawr

11:27 PM

@ATaco post-fix somehow sounds strange, but you're probably right!

ATaco

One language in particular treats operators as quicks, so 1+3 would work, as it treats +3 as a single token.

Zacharý

I? K?

Esolanging Fruit

In most stack-based languages, most operators operate on the top elements of the stack, but plenty don't, such as ] in CJam (or & in Ly, which makes an operation apply to the entire stack)

flawr

@ATaco do you have docs somewhere?

ATaco

I don't even remember the name of the language.

github.com/aaronryank/simplestack

Found it

Me and Dennis had a race to quine in that language, with Dennis getting the winning quine a handful of minutes before myself.

A: Golf you a quine for great good!

SimpleStack, 20 bytes «@171%@187»@171%@187 This didn't work in older versions of SimpleStack. Try it online! How it works «@171%@187» Push the string '@171%@187' on the stack. Let's call it s. @171 Print '«' (char code 171), without pushing it on the stack. ...

Zacharý

11:33 PM

1 is a quine ...

ATaco

Not a valid quine.

Literal Only quines are not considered valid by our definitions.

I think I still hold the shortest valid quine, but I could be wrong.

RProgN 2, 3 bytes Try It Online!

Zacharý

If a language has X be output top of stack followed by X, and W pushes W to the stack, then it can beat it. But that'll never happen.

Esolanging Fruit

@Zacharý Reminds me of Jelly's “ØV”ṘV

ATaco

The benefit to this RProgN solution is it is expandable.

Anonymous

CMC: Given an array of positive integers whose sum is S, partition it into two arrays whose sums are each S/2. S will always be even. Examples: [50, 50] -> [50] [50], [1, 1, 1, 1, 1, 1] -> [3] [3], [1, 2, 3, 4, 5, 6, 7] -> [14] [14]

Anonymous

11:45 PM

If it's impossible to form the two equal-sized partitions, fail in whatever spectacular manner you wish

Esolanging Fruit

CJam, 8: {:+2/a_}

Wait I'm confused

It just takes the sum, divides it by 2, wraps in array and duplicates

Anonymous

Err, wait, I messed up the examples

Anonymous

[50, 50] -> [50] [50]; [1, 1, 1, 1, 1, 1] -> [1, 1, 1]; [1, 1, 1], [1, 2, 3, 4, 5, 6, 7] -> [1, 6, 7] [2, 3, 4, 5]

Anonymous

Output does not need to be sorted

Anonymous

Failure example: [5, 3] -> sudo rm -rf --no-preserve-root /

ATaco

11:48 PM

Oh...

Zacharý

.........

Anonymous

In other words, solve subset-sum :P

Sherlock9

I see you're going for non-devious challenges :P

ATaco

Input validation is bad.

Anonymous

@ATaco There's a reason for the input validation here: it's inspired by Fortnite Battle Royale's struggle to partition groups of 1, 2, 3, and 4 into two teams of 50.