The Nineteenth Byte

user

2:05 PM

@StackMeter There are more important things in life than rep and badges

StackMeter

@user yes

but not many

Adám

@user Yup; shaving bytes.

StackMeter

that's one of them

user

@Adám I was going to say money, but that works too :P

Adám

Money has no inherent tangible value, but saved bytes are truly saved.

5

user

2:08 PM

Wise words

Adám

But in a sense, money, medicine, and code bytes are similar: You should want as little of each as necessary, but no less than that.

CMQ: Why do projects count LoC instead of BoC‽ You can artificially lower your line count, but you can't cheat on byte count.

user

Because it might make people give their variables and functions really short names, which is bad for maintainers

what is ‽

! + ?

An interrobang

2:12 PM

The interrobang (), also known as the interabang (‽) (often represented by ?!, !?, ?!? or !?!), is an unconventional punctuation mark used in various written languages and intended to combine the functions of the question mark, or interrogative point; and the exclamation mark, or exclamation point, known in the jargon of printers and programmers as a "bang". The glyph is a superimposition of these two marks. The interrobang was first proposed in 1962 by Martin K. Speckter. == Application == A sentence ending with an interrobang asks a question in an excited manner, expresses excitement or disbelief...

StackMeter

@hyper-neutrino so if not?

user

Plus, if you make everyone use the same auto-formatter, you can't artifically decrease or increase your line count (idk what people actually do irl though)

Adám

It indicates rhetorical questions.

Maybe we need CMR for Chat Mini Rhetorical-question.

or CMRQ.

caird coinheringaahing

@Adám I can always cheat on byte count: 0 bytes in MyMadeUpLanguage :P

user

2:30 PM

CMRQ: Why are there so many mediocre languages with great tooling and great languages with mediocre/poor tooling?!

Adám

@user ?! ‽ TFTFY.

user

Not all of us have keyboards as powerful as yours :P

Adám

If you can download RAM, surely you can download a keyboard.

@user What OS are you on?

user

Windows

Adám

Then you can just download my kbd.

user

2:35 PM

@Adám I tried, but all I could find were hard copies like this one

Adám

github.com/abrudz/Kbd

user

@Adám Wait, the interrobang is on your keyboard‽

Adám

Yes. AltGr+Shift+U,?

user

I've downloaded it already, although I can't try it right now because I'm on my mom's computer

@Adám Nice, I'll have to try that later

Adám

CMC: produce an SE chat message that says backtick space backtick

hyper-neutrino

2:43 PM

backtick space backtick

user

Ninja'd

PyGamer0

` `

Wezl

` `

no escaping is necessary

user

Here's the Sandbox in case you need it

PyGamer0

How does esolangs implement 2d array input

user

2:53 PM

[[inner,arr],[another,inner,arr]]?

PyGamer0

what about input from stdin

how do they convert that

hyper-neutrino

well you can just eval it

PyGamer0

eval is not working

atleast when i try to pass it into numpy.array

hyper-neutrino

define "not working"

PyGamer0

ok i am dumb

error on my end

caird coinheringaahing

3:10 PM

@Adám Haven't we already done this, or was that with backtick backslash backtick?

pxeger

3:23 PM

@Adám ` `

New Posts

0

Q: When's my weekend finally here?

I like my job, but sometimes it can get a bit tedious and boring. As motivation, I want to know how many hours of work are left before I finally get my two days of weekend and relaxation. I work every day from Monday to Friday, totalling 38.5 hours, starting at 9am and ending at 6pm. Every day -...

code-golf

PyGamer0

i think i found a very useful module for python: github.com/gruns/icecream

this also looks pretty good: github.com/alexmojaki/snoop

Anush

4:09 PM

would anyone be so kind as to help me fix my fractional cascading code please

user

What's wrong with it? (depending on the problem, it may be better for SO)

EliteDaMyth

this reminds me of this website: dontasktoask.com

Adám

@cairdcoinheringaahing that was backtick backslash

ngn

what's the easiest algorithm to encode any string as monospaced chat markup?

dzaima

@ngn you can't encode any string as a codeblock in SE chat

Anush

4:17 PM

@user bpa.st/Z5AQ

I am just not sure how to get it right

it should be a lot like randomized median finding

user

I can't help you with Python, but

> print("Aargh! This shouldn't happen")
0/0

:)

that's very sus

sus in what sense?

Why not raise ValueError("aargh!")?

Anush

4:19 PM

@ngn hi

@user that's a better idea

dzaima

@dzaima If the string doesn't end with \, you just replace ` with \` and surround in backticks. If a string doesn't start or end with a backtick, you can surround it with more backticks than the longest run in the string. Otherwise (i.e. starts with `, ends with \), you're out of luck

ngn

@Anush hi

Anush

@ngn could you help me with the fractional cascading please?

I am frustrated and stuck

the profit should be 1036.0731707317073 in this case

1036 3/41

ngn

@dzaima wow, so complicated. i think i'd better just append a space if it ends with \ and be done with it.

or replace \ with a visually similar character

@Anush i'll have a look in a moment

Anush

@ngn thanks so much

I wanted the faster linear time algorithm (linear time on average is fine too)

user

4:28 PM

May I ask what this is for?

Anush

@user is that for me?

user

yeah

Anush

I like algorithms and wanted to see how much faster the linear time algorithm is than sorting

the plan is to reimplement it in C once it is working in python and compare to qsort

hopefully a lot faster!

ngn

@Anush it seems to get stuck in infinite recursion when l,r (left and right) are one unit apart

Anush

@ngn yes. I think my partitioning part is correct but I have screwed up the recursion

can you see how to fix it?

I feel there is a clean and elegant solution hiding and it would be great to find it

caird coinheringaahing

4:36 PM

CMC: Given n > 1, output a prime with n digits that contains n as a substring in the digits.

ngn

primes are so common, you can start by padding n with zeroes and just look for the first prime after that

caird coinheringaahing

There are definitely multiple approaches - my Jelly answer is shorter than trying to do that

Anush

it be would harder if you had specified perfect numbers :)

caird coinheringaahing

It's a cmc, it's not intended to be too hard :P

Anush

:)

caird coinheringaahing

4:45 PM

I have 9 bytes in Jelly :P

ngn

@Anush why do you have low=l; high=r? shouldn't the sorting order be descending?

New Posts

0

Q: Print instructions for typing \` in chat

Background As far as we can tell from trying everything (besides cheating with ZWSPs), you can't type `\ in chat. However, you can type \` by doing `\\`` (I'd love to put these in-line, but no matter if I try using backticks or <code></code>, it breaks formatting here as well. Markdown makes m...

code-golf string

Anush

@ngn it should. The idea is that l and r just specify the subarray you are looking at

we update low and high in the partitioning scheme so I thought we should keep the original values as l and r

low and high are indices, not values in the array

Aaron Miller

Where is the chat sandbox thing for testing chat stuff?

hyper-neutrino

Sandbox

Where you can play with chat features (except flagging) and ch...

4

ngn

4:55 PM

@Anush your comments are wrong then

Anush

@ngn oh which ones?

ah yes.. they should say densities[low] etc

thanks

hyper-neutrino

I have ⁵*ÆRD³D¤ẇƊƇṪ for 12 bytes :c

Aaron Miller

So, a line of \ just turns into one less \ than was in the line?

Dang it markdown

caird coinheringaahing

@hyper-neutrino do you have a target in Jelly for your new challenge?

Anush

@ngn an improved version but with no bugs fixed bpa.st/MMJQ

caird coinheringaahing

4:58 PM

@hyper-neutrino Doesn't ẇ convert it's left argument to digits?

hyper-neutrino

does it? ¯\_(ツ)_/¯

Aaron Miller

Vyxal uses ` for strings, so if you had to escape every backslash in markdown, you could just do q to solve the challenge.

hyper-neutrino

@cairdcoinheringaahing I have 16 but it can almost certainly be shorter

caird coinheringaahing

@hyper-neutrino Yes it can - see my answer :P

hyper-neutrino

→ 3 messages moved to Sandbox

caird coinheringaahing

5:01 PM

@StackMeter Sandbox please, not here

hyper-neutrino

@cairdcoinheringaahing nice :P

i was doing length-each increment \-repeat

StackMeter

oh ok

SlamJammington

Has there been a golf for causing a BSOD or locking up the system?

Anush

@SlamJammington tricky to test :)

caird coinheringaahing

You should've waited a few hours @hyper-neutrino, I've already rep capped today :P

hyper-neutrino

5:04 PM

@cairdcoinheringaahing well, I haven't, but I'm reasonably close :P

hint: I skipped the sandbox on this challenge

caird coinheringaahing

235

Q: Code that will only execute once

Goal The goal of this challenge is to write code that will execute once and only once. This means basically that it damages the program, script, or environment in some way. If rebooting the system allows the code to run again that is permitted. Scoring Number of votes. All assumptions must ...

popularity-contest stateful

SlamJammington

@Anush True, you could run it on virtual machines but thats a lot of hassle

caird coinheringaahing

@hyper-neutrino Yeah, that's always a strong indicator :P

hyper-neutrino

although I also should've waited a few hours; unless everyone suddenly decides to hate my challenge i'm going to cap well before UTC 0h

@cairdcoinheringaahing ha, the vigil answer on that is a perfect example of the absolute correct tool for the job :P

SlamJammington

@cairdcoinheringaahing thanks! I knew something similar had been done before

Also, is it okay if you post an answer with the same language as someone else? I assume it is, but i just wanted to check

ngn

5:08 PM

@Anush why does your sortsolution() use a different densities array?

hyper-neutrino

yes, absolutely - by policy we won't even delete identical solutions (unless there's clear plagiarism which has happened) especially if they were posted really close to each other (though the one who lost the FGITW will usually self-delete it anyway)

Anush

@ngn argh.. it shouldn't!

SlamJammington

Sweet, thanks!

Anush

@ngn are you sure it's different? It is meant to be the same

ngn

@Anush it consists of the same values as the first densities, but i was wondering why you have to redefine it

caird coinheringaahing

5:11 PM

@hyper-neutrino 11 bytes :P

Anush

@ngn oh that was just because my jupyter notebook was changing the values of densities for some reason and I wanted to be sure

hyper-neutrino

@cairdcoinheringaahing oh that's clever i should've thought of that xd

caird coinheringaahing

Ugh, I hate that y is character only

hyper-neutrino

yeah :/

ngn

@Anush unbloated version:
https://tio.run/##jVLbcpswEH3XV2zjF4jXg7HNxXKUX@gHMH6gQtSiGBhJNnF/3pUsQppMH8owaDlnOXvY3eFmTn23vd8X36KLVtEP2UWiu8LgcVKr/gzalEZqI7kGeR56ZeAsKll2pBI11EGLCisckYcUFi1tRW1QUSV/ngxWtBKdlkYKjSMdhQM1csrLoeTS3AjIGlrGbL4wF9XBQ8yirD00TB0G5ksFRVXII1ZF4x6BXDZhFG2OxxAWAx3ktTcoaduP2NCTrUFgPMlWgHxpKAFXA8AJvLIByq4Cp2NjKpcstrxobcZX/gUG2qw@8xb7b97pz6bZ5FweD6PDRofN0WHW0YKWWgvb4jUBzfTlHIyFtRkfw0er9IvtHeMrfZDYYMVq24p47j/xTvQrp@90686JnFr8oAjhLM/2sJgncWXFPsZsg/s17lJMEsxxm2CWYBpjbIMMd2tMtw7Z7N0zzjDLHbjbHe0cVF9Lo8nIinyH@RZ39rYUpphb0Q1uEocmKcY5JjnGlswxW@M@xe0G09zmWJlpR0jFirfoBnWv4A1vIDv4LYfgi…

caird coinheringaahing

5:15 PM

Although, even if it were, it's still 11 bytes

ngn

jupyter notebooks should be banned

@Anush are you sure this is O(n)?

hyper-neutrino

after discovering that "replace ` with \` and surround with `" is a solution my challenge is quite boring now :c

caird coinheringaahing

Any feedback?

Aaron Miller

5:31 PM

@hyper-neutrino It's deceptively difficult in Vyxal since it uses ` as string delimiters.

hyper-neutrino

lol

ngn

@Anush actually, your first function moves around the values in the array, so it would be better to copy it

@Anush this doesn't look correct:

        weights[low], weights[high] = weights[low], weights[high]

hyper-neutrino

doesn't vyxal have escapes tho, so it's just lengthier

Aaron Miller

Vyxal uses \ for escapes

hyper-neutrino

right but you can still do something like `\`` \` V probably

Aaron Miller

5:40 PM

But, for example, `\`\\\`\\`\\\`\`` becomes `\`\\`\`\\`\``, and I need to turn some of the 1-long lines of \ into \\ and some of them into \\\.

hyper-neutrino

wait does \ have special meaning with V as well

if you can't use V you can probably just use the split length increment repeat join method

lol Pip uses ` for regex and has the exact same escaping mechanism with SE chat so uh...

it's like if q worked in vyxal :P

Aaron Miller

Clearly, I don't know how markdown works.

hyper-neutrino

yep .-.

pip bug is a feature i guess :P

if \\ became \ and \` became ` this would be far too trivial

Aaron Miller

Yeah. However, I was able to get kinda close, so that's something, I guess?

math

final feedback please?

ngn

5:55 PM

@math you don't have a test for the "mega double plus"

math

Shall I make one?

ngn

well, if you want your challenge to be taken seriously :)

math

ok

It'll take some time

`\

Anush

@ngn argh that looks wrong

@ngn it is if you really choose the median or if you pick a pivot at random (then it is linear time on average)

@ngn I guess f doesn't work yet?

@ngn I was hoping it could be inplace, like partitioning in quicksort

@ngn it no longer recurses forever at least

@ngn I still don't know how to get the right answer from it though

user

6:14 PM

rip @ngn's inbox :P

Anush

@ngn version with the bug you spotted fixed bpa.st/7JUA

ngn

6:35 PM

@Anush my reasoning is: assuming good pivoting, there will be log(n) iterations. at each iteration you compute sum(weights[:low+1]). "low" is n/2 on average, so the whole algorithm is O( log(n) * n/2 ), aka O(n log n)

(could be wrong)

Anush

@ngn you need to add n + n/2 + n/4 - ...< 2n

It's the same reasoning as finding the median of an array in linear time

ngn

@Anush but you're summing from low till the end of the array, not just till the end of the current slice

Anush

@ngn if I am doing that it is wrong. The portion of the array being considered should half in length each time

hyper-neutrino

isn't finding median linear log to sort and constant to get if sorted

Anush

@ngn that's another bug then.

@hyper-neutrino no. You do it recursivejy but only look at one half at each recursive step

hyper-neutrino

6:42 PM

how do you halve the array and be sure the median is on a specific side

Anush

@hyper-neutrino pick a pivot at random. Then move everything smaller than it to the left and everything bigger to the right. You now know the rank of the pivot. If it is more than n/2 you know the median is in the half. Otherwise it's in the second half. Then recurse

hyper-neutrino

@Anush if you're assuming the array is sorted anyway isn't finding the median just a[a.length / 2]

Anush

@hyper-neutrino no I am not assuming it is sorted. It is trivial if sorted as you say

hyper-neutrino

oh wait

i misread that

i see how this works. yeah that sounds right - didn't think median of unsorted array was possible sub-linear-log but that's cool

Anush

"in the half" should be"in the first half"

@hyper-neutrino it is cool. But I am failing to implement a similar algorithm!

And hoping ngn can fix it

ngn

6:50 PM

@hyper-neutrino actually, we're not looking for the median but for something similar - an index i such that sum(x[0], x[1], .., x[i-1]) is as close as possible to a given "capacity", where x is the sorted input (though we don't explicitly sort it)

Anush

This problem en.m.wikipedia.org/wiki/Continuous_knapsack_problem

ngn

        return ((cumweight+weight-capacity)/weight)*(density*weight) + cumprofit

@Anush ^ you could cancel the weight-s

Anush

@ngn true!

Or just use the profit vaiue which we also have

pxeger

7:31 PM

I wish SE chat would make me leave the room when I close the tab

hyper-neutrino

it does after like 15m i think

or some amount of time

why do you want instantly tho

pxeger

because it clutters up my right side bar, and shows me messages that I no longer care about

(or never did care about)

cough sandbox cough

hyper-neutrino

oh wait that's what you meant sorry

yeah i'd rather it not, because i don't want to have to keep 18 tabs open

*19, apparently i'm in 19 rooms right now

A username

@pxeger Sorry

pxeger

lol it's not your fault

AviFS

7:38 PM

Hey @ngn, great to see you!

Or at least to read you

hyper-neutrino

also thanks for fixing my question text lol (pxeger)

pxeger

np

Nothing a little https://gchq.github.io/CyberChef/#recipe=To_HTML_Entity(true,'Numeric%20entities') can't fix

hyper-neutrino

huh that's cool

AviFS

Do any stack langs have a (repeat operation until there's one element left on the stack) commands?

pxeger

Yeah - I don't have many bookmarks on my toolbar, but CyberChef is one of the few

AviFS

7:42 PM

Eg. +. would keep popping and adding the first two elements, until you were left with the sum of the stack?

hyper-neutrino

so wrap + reduce?

AviFS

Is that what that command is called?

pxeger

it's not necessarily reduce, because it can "return" multiple accumulator values (by pushing more than one thing on the stack), and accept multiple items at a time

hyper-neutrino

true

pxeger

\o caird

AviFS

7:45 PM

So what's an example of a stack lang that has that?

⍤/

pxeger

none, that I'm aware of

AviFS

Really?

pxeger

I'll add it to the feature ideas for mine :þ

AviFS

Is that worth recommending for, say, Vyxal?

pxeger

yes probably

AviFS

7:46 PM

Oh, nice!

pxeger

@lyxal ^^

caird coinheringaahing

@pxeger o/

It's weird to be joining/leaving the room tbh

AviFS

In my case, it sounds like wrap/reduce would work @hyper-neutrino. How do you do that?

caird coinheringaahing

In what language?

AviFS

Just for the record, I said hi too!

Any stack lang

caird coinheringaahing

7:49 PM

@AviFS Oh sorry, I didn't notice! Hi :P

hyper-neutrino

@AviFS Wλ ... ;R in vyxal

just wrap the stack and reduce over some function

ngn

@AviFS hi avi, great to see you too

AviFS

@cairdcoinheringaahing Just giving you a hard time, haha

hyper-neutrino

not the same as what you asked for as pxeger pointed out, but if you have a ,_=> function this works i think

idk if this reduces the right way

AviFS

@ngn Yeah, it's been a while!!

caird coinheringaahing

7:50 PM

I normally have my laptop open/on all the time so I'm always in the room. Except I'm currently not at home for the past few days, and am only using my phone to check in on the site/TNB from time to time :P

Therefore, joining and leaving the room everytime :P

hyper-neutrino

wait where are you right now :p

AviFS

@ngn Is ngn/apl made for golfing?

Or does it stick with the APL philosophy

caird coinheringaahing

@hyper-neutrino About an hour's drive from Adám :P

As opposed to a 2.5 hour drive

hyper-neutrino

i see :p

AviFS

Because I had a wildly unpopular idea for a golfing APL

hyper-neutrino

7:52 PM

sounds like jelly with extra steps

caird coinheringaahing

(I'm checking out accommodation options at the uni I'm going to in the fall)

AviFS

@cairdcoinheringaahing I love the metric, haha

hyper-neutrino

ah that's a good idea :p do you like it so far? (i'm assuming you've already been there if you've been away for a couple of days)

pxeger

@cairdcoinheringaahing how do you know where Adám lives precisely enough that you can define how many hours' drive it is? (London + driving = wild)

caird coinheringaahing

Plus meeting up with some old friends, I used to live here :P

AviFS

7:53 PM

Oh nice! That's a great idea

WHich one?

ngn

@AviFS i don't maintain it anymore but it's still available on tio.run

caird coinheringaahing

@pxeger I'm Google Maps

pxeger

Does Adám make his address public?

hyper-neutrino

aplwiki.com/wiki/Ngn/apl

AviFS

@ngn I know, just curious what the intended audience/use case was

caird coinheringaahing

7:54 PM

@pxeger He's made his area public

@AviFS Bristol University

AviFS

Ooh, congratulations!!

hyper-neutrino

i don't think ngn/apl changes that much (if at all) over standard APL (is there a "standard APL"? I assume it's just the dyalog official implementation?)

caird coinheringaahing

@AviFS Thanks, should be a fun 4 years :P

AviFS

@ngn The idea was to notice that =/ is useless. And that checking if all elements are equal is very difficult. So I was wondering about changing the behavior of =/ to do that

ngn

@hyper-neutrino there are standards but paywalled and too old

pxeger

7:55 PM

@cairdcoinheringaahing I was gonna say that's fair enough because people know he works at Dyalog and they know where Dyalog's offices are, but given the following I'm assuming he works remote:

caird coinheringaahing

I actually used to live in Bristol when I was a kid, and so I've got a lot of old friends here. It's going to be nice to meet up with them

AviFS

So for instance 3=/ would check chunks of 3 to see if they were all the same, useful for say a tictactoe game

pxeger

(nightmare commute from anywhere in London if not)

caird coinheringaahing

@pxeger Adám has publicly said the first 3 bits of his postcode here IIRC

AviFS

Currently n=/ is an entirely useless function for all n except n=2. (And n=2 would work the same way if it were implemented this other way.)

Adám hates it because then =/ is different from {⍺=⍵}/. So it's a case of consistency vs utility, which is why I was wondering if it was for golfing

</rant>

caird coinheringaahing

7:58 PM

@AviFS Check all elements equal the first

AviFS

Right, that!

caird coinheringaahing

It's 5 bytes in APL (I think, maybe more because of its chaining rules)

AviFS

Yeah, @Bubbler came up with this:

3(⌊/=⌈/)1 0 0 0 1 1

Which is pretty pesky for golf

hyper-neutrino

I don't like the idea of special-casing = in =/ even if it's in a golfing language because it's just confusing and you may as well just implement E

much less for APL lol

caird coinheringaahing

@AviFS =/ checks if the array is in the form [n,n,1,1,1...] or [n,x,0,0,0,0,...]

AviFS

8:01 PM

@hyper-neutrino But it's absolutely useless, except for 2=/ which would stay the same were it changed

pxeger

@hyper-neutrino My golfing language has as framework for replacing code that would otherwise duplicate other code with different builtins (e.g. [reduce] [add] already exists as [sum], so [reduce] [add] is now FizzBuzz). MAXIMUM ENTROPY!

hyper-neutrino

well not exactly useless, it does what caird mentioned which isn't really helpful for most cases but this behavior is expected

all-equal is not reduce by equality anyway, it's its own function

AviFS

@cairdcoinheringaahing It's a lot more complicated than that, I'm actually writing a code-golf challenge as a decision problem that would run =/ on a list

Eg. =/0 0 1 0 1 0 is truthy

caird coinheringaahing

@hyper-neutrino Reducing is often thought of as "joining the array with the function", so if you did it like Python chains comparisons, then =/ would be all equal

</ would be "is descending" and >/ would be "is ascending"

AviFS

That would also be way more useful!!

You're totally onto something, caird

caird coinheringaahing

8:04 PM

That could be a different form of reducing tho

AviFS

I propose this behavior for a golf apl

That's true

hyper-neutrino

hm, true

AviFS

Even Dyalog could implement this, I suppose

caird coinheringaahing

It does involve that "interpretation" of reducing, and having comparison chaining rather than associative functions

AviFS

Speaking of notation as a tool of though, I think =/, </ & >/ are really clear ways of reading, 'equal', 'descending' & 'ascending'. Just with a different reduce op as suggested

caird coinheringaahing

8:06 PM

For example, if you understand reducing as "Do x to the first two, then do x on that result and the next element and so on", it doesn't make sense

hyper-neutrino

this form of reducing is just {∧/¨ 2 ⍺⍺/¨ ⍺ ,/ ⍵}

AviFS

@Adám What do you think of this?

caird coinheringaahing

@hyper-neutrino Yes indeed, I know what this says :P

AviFS

@hyper-neutrino That just means it won't be so hard to implement!

But you can't possibly advocate for that as good notation for something so conceptually simple

@cairdcoinheringaahing ikr haha

hyper-neutrino

given a number n on the left, a function f on the left, and a vector a on the right, this is an operator that n-wise reduces a over pair which gets slices of size n of a, then pair-wise reduces each slice by f, then reduces each result by AND

caird coinheringaahing

8:08 PM

Yeah, the ⍺ ,/ ⍵ was the main bit I didn't get

AviFS

Ah, I see, that does work!

So you're basically doing this for </, right?

∧/2</1 2 3

hyper-neutrino

well it works for any function

caird coinheringaahing

That doesn't work if α isnt passed as a argument (aka =/)

hyper-neutrino

^

idk how to implement it to work for both monadic and dyadic

Adám

@AviFS I'd rather have a way for ⌺ to handle the edges better.

hyper-neutrino

8:11 PM

SFF election finished; TheLethalCarrot won

Adám

(Why do I feel like I'm in the APL Orchard here?)

caird coinheringaahing

@hyper-neutrino Good, my top candidate :D

dzaima

@Adám ⌺ is so overkill for this though (and most things really)

hyper-neutrino

it wasn't even close

TLC had almost majority from the first round alone

caird coinheringaahing

User931 got too much of the vote :/

AviFS

8:13 PM

Hey @dzaima, long time no see!

@hyper-neutrino All the more reason to introduce a new operator, no?

Can we make this a feature request for abrudz/extended?

dzaima

@hyper-neutrino imo that has two separate parts - f←{∧/2 ⍺⍺/⍵} and g←{⍺,/⍵}, composed as operand f¨ ⍺g⍵. g also then becomes the other reduce-like thing discussed

Adám

@pxeger Not that bad, actually. There was a while I went from London to the office Sunday night, and returned home Thursday afternoon. I've also commuted from (far) west London to the office on a daily basis. That was nice, as I went against the peak flow.

AviFS

(gtg, I’ll be back later!

dzaima

@dzaima (of course g is still broken on non-simple ⍵)

caird coinheringaahing

@Adám That's a hell of a traffic jam

Adám

8:19 PM

@cairdcoinheringaahing Where? When?

caird coinheringaahing

@Adám Leaving London on Sunday night and returning on Thursday afternoon, that's almost a 4 day jam :P

Adám

:-P

hyper-neutrino

lol

Adám

Dyalog rents a really nice house about 15 mins by car from the office. People from afar stay there when they visit HQ.

A username

Repcap!

New Posts

8:37 PM

0

Q: Try to simplify/shorten this python code

New to codegolf.stackexchange. Was wondering if it's possible to make this code more simple/smaller (XOR Encryption, One-Time Pad) a=lambda*b:''.join(chr(ord(c)^ord(d))for(c,d)in zip(*b))```

code-golf python

A username

Dimitriy?

Adám

9:03 PM

@pxeger @cairdcoinheringaahing I'm here:

Lynn

9:37 PM

@Anush I gave it a shot after seeing it linked in the starred messages list: codegolf.stackexchange.com/a/230327/3852

I hope 50 isn't "so boring and long that nobody bothered submitting their 50"!!

I think 90% is a nice sweet spot and 95% will be a bit frustrating/unforgiving, especially if the word list isn't very carefully curated, which no 10k word list really is. For example the English one here has la and the Spanish one has iceberg

New Posts

9:58 PM

0

Q: Time till Friday

Output the time I need to wait till Friday, in seconds; or zero if it's already Friday. Your program shouldn't run for more than 1 second on a reasonable computer. (This avoids someone waits till Friday and outputs 0) Shortest code in each language wins. Languages without access to clock can read...

code-golf date

Sandbox

Transcript for