The Nineteenth Byte

Mr. Xcoder

18:00

Python, 18 bytes: lambda n:chr(n+65)

Conor O'Brien

@Mr.Xcoder can the input be like 0123456789:;<=>?@ABCDEFGHI for inputs 0, 0, 1 ... 25?

Mr. Xcoder

@ConorO'Brien Sure

Conor O'Brien

cool

Mr. Xcoder

Sorry for responding late

How can community award bounties?

4

A: Grocery Store Micromanagement

Python 2, 477 463 453 449 423 402 397 396 393 bytes t=input() e=enumerate q,r=" s" for i,L in list(e(t))[:0:-1]: for j,c in e(L): a=t[i-1][j] if"0"<c<"6":L[j]="0 1234"[int(c)] if(r==a)*q==L[j]:t[i-1][j],L[j]=q+r if"e"==a:L[j]=r if r==L[j]and"x"==t[i+1][j]:L[j]="5" if"Y"in L:x=L.count(r)...

Conor O'Brien

oh crap I forgot to award the bounty

Mr. Xcoder

18:05

This answer specifically ^ +25 from Community

wizzwizz4

@JohnDvorak When the time bomb in the firmware goes off.

totallyhuman

@Mr.Xcoder somebody set a bounty

And forgot to reward it

John Dvorak

It's way past the warranty

Conor O'Brien

@Mr.Xcoder BF:,+++++++++++++++++.

Mr. Xcoder

@totallyhuman And forgot abut it and was auto-rewarded

totallyhuman

18:06

Yes

Mr. Xcoder

@ConorO'Brien Oh nice, nice BF

wizzwizz4

@JohnDvorak Has it been being updated?

Mr. Xcoder

tio.run/##SypKzMxLK03O/v9fRxsd6P3/bwIA

wizzwizz4

There are some people I wouldn't put past breaking a discontinued or out of warranty product.

Mr. Xcoder

Why is Main soo sleepy today?

John Dvorak

18:09

It's an Asus router and I haven't touched its update function ever. Even if it could auto-update, why would it now?

Also, the admin interface still claims it's been designed for IE5.0.

It's also purple and yellow and I'm afraid to look at it with my AMOLED phone.

It seems to only support manual updates - you download the firmware to your computer, then push it to the router.

> In case the upgrade process fails, ASUS Wireless Router will enter an emergent mode automatically. The LED signals at the front of ASUS Wireless Router will indicate such situation. Use the Firmware Restoration utility on the CD to do system recovery.

Yeah, it has enough brains to start flashing wildly and get a fresh firmware through specialized software, but it doesn't have enough brains to revert to the old firmware or to show a web interface.

Step Hen

@trichoplax The letters aren't commands, that's the reason I'm doing it like this

John Dvorak

The ASUS website doesn't even know this router model exists...

trichoplax

@StepHen Ahhh...

Step Hen

@JohnDvorak You 100% sure it isn't a Chinese copycat? I got Orocs from China (instead of Crocs)

John Dvorak

WL520gc

HyperNeutrino

18:20

@StepHen that is IMO a pathetic copycat-renaming xD

@Mr.Xcoder Sunday

Step Hen

@HyperNeutrino I think I lost them or I'd get you a picture, lemme look around

John Dvorak

If it was a rip-off, I want another one 😛

HyperNeutrino

@JohnDvorak lol why xD

John Dvorak

It lasted for quite a while

HyperNeutrino

ah I see

Step Hen

18:23

@HyperNeutrino couldn't find any in my house, but these were like them:

HyperNeutrino

ಠ_ಠ lol

What I don't get is how they don't get sued xD

Step Hen

@HyperNeutrino I think international copyright/trademark law isn't quite the same as domestic

HyperNeutrino

probably

Step Hen

Dunno the intricacies, and I guess they have some reason to not just use the exact same name

HyperNeutrino

Yeah

Step Hen

18:25

But you can also get YouKu in China and that has full movies just on it

HyperNeutrino

lol

totallyhuman

Hi

HyperNeutrino

hi

Erik the Outgolfer

can I have some feedback here please?

totallyhuman

Yes

If scientists can find and lose the higgs boson, people can get feedback in the sandbox

Erik the Outgolfer

18:33

umm, without calling for feedback or something?

John Dvorak

They didn't lose it

totallyhuman

Yes

@JohnDvorak it'd be pretty funny if they did

Erik the Outgolfer

well they can't lose it >_<

John Dvorak

They didn't lose it. It just ... broke.

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Swap the frogs! Given 2 integers N >= 1, representing left-side frogs, and M >= 1, representing right-side frogs, return all the steps required so that the frogs change sides with the minimum number of steps. The frogs start with one empty spot between the two sides. A frog can jump to the empty...

0

A: Sandbox for Proposed Challenges

Divisible by 1000003? Easy, just multiply the last digit by 300001 and add! code-golf number arithmetic Given a prime P greater than 10, your program or function must figure out its divisibility rule x, defined as the integer with smallest absolute value which yields a multiple of the origina...

Erik the Outgolfer

18:35

@NewSandboxedPosts hey dat quick

Step Hen

um Sandbox has ~4000+ answers. Is that the most of any SE question?

totallyhuman

Also, <insert relevant xkcd here>

Step Hen

(including deleted I think)

wizzwizz4

@StepHen I don't think so.

Step Hen

@wizzwizz4 so what is? :P

HyperNeutrino

18:38

Maybe the other Sandbox? (There's another site with a sandbox)

wizzwizz4

@StepHen A sandbox for a more active site.

Ninja'd.

totallyhuman

SEDE is a nice tool

Step Hen

@totallyhuman but... it's per-site

John Dvorak

SEDE is site specific, though, and ignores deleted posts

Step Hen

and I know it's possible to make it network-wide, but I dunno how

totallyhuman

18:39

It's still a nice tool :P

Erik the Outgolfer

sede all sites that have sandboxes and pick the maximum

except that sandboxes can often be retired

wizzwizz4

@StepHen Make a thing under the same ID on lots of sites.

@EriktheOutgolfer Ooh. That'll do it.

That'll stop it getting too big.

That means we might have won...

Step Hen

I think we're the only site with a big Sandbox, puzzling and math both are <100 (undeleted) answers and I dunno any others

John Dvorak

How many sandboxes have we burned through already?

totallyhuman

Ye right

Step Hen

18:40

@JohnDvorak we stopping retiring at one point, so I dunno

wizzwizz4

@JohnDvorak One, I think.

John Dvorak

twenty or so?

Erik the Outgolfer

@wizzwizz4 at least we've won cr for sure...especially since cr doesn't have a sandbox at all

HyperNeutrino

For many sites a sandbox would be really hard to maintain and also quite unnecessary.

wizzwizz4

@EriktheOutgolfer Woop! Beat that, Code Review! Oh, wait. You don't golf. :-D

Step Hen

18:41

I'd also be curious what the highest answered post on any main site is, it may be Hello World

John Dvorak

Let's just migrate the sandbox to main and claim the price

HyperNeutrino

... ಠ_ಠ

Step Hen

@JohnDvorak then we can't feature it :(

HyperNeutrino

Hey I got upvotes

@StepHen That's not the worst of it :P

John Dvorak

CMC: bring up the worst of my last suggestion

HyperNeutrino

18:43

People will gain/lose rep for sandbox posts which is one of the reasons it is on Meta

Step Hen

@JohnDvorak New people will accidentally post questions that should go to main to Sandbox... oh wait

totallyhuman

Kek

John Dvorak

that won't happen

Step Hen

@JohnDvorak way to ruin my ideal

John Dvorak

It would be nice though

HyperNeutrino

18:44

I wonder: Which site gets the least new users (that post something) over time?

anyway brb

Step Hen

@HyperNeutrino well Vegetarianism only has 858 users, and Esperanto only has 984 users (total for both)

John Dvorak

CS50 or whatever it's called, perhaps. Can't find it.

wizzwizz4

@HyperNeutrino I think *site-that-is-in-private-beta* probably has the fewest over time.

Step Hen

Beer, Wine, and Spirits and Sustainable Living get .1 questions a day

John Dvorak

Is Sustainable Living a sustainable site?

Step Hen

18:47

@JohnDvorak I dunno, it gets 1.4k visits/day but Community Building only gets 34 visits a day

John Dvorak

how?

Step Hen

dunno

John Dvorak

but then again the Bible hasn't got an official update since almost two thousand years ago.

8

couple of fan-fics, though

Well... it hasn't needed one, so perhaps that's why.

Leaky Nun

1

A: One OEIS after another

90. Open Shading Language (OSL), 66 bytes, A000201 shader abc(int i=1, output float o=1){o=floor(i*((1+sqrt(5))/2));} Next Sequence

One day left...

Step Hen

@LeakyNun what would it take to compute those numbers?

or at least some of them

Leaky Nun

18:50

> A000066 Smallest number of vertices in trivalent graph with girth (shortest cycle) = n.

@StepHen you need to make trivalent graphs

John Dvorak

how do you compute this kind of things?

Step Hen

so how do you do that? @LeakyNun

Leaky Nun

@JohnDvorak represent a graph with an adjacency matrix

Mr. Xcoder

You don't.

Leaky Nun

check that each column and row sum to 3 (to be trivalent)

John Dvorak

18:51

Welp, that's ... slow.

Leaky Nun

then find the girth of each graph

@JohnDvorak you just need to theoretically output the answer

John Dvorak

I should have realized what site I'm on.

Step Hen

@JohnDvorak it has to be short, not fast :P

Leaky Nun

@StepHen it doesn't

totallyhuman

There should be a title up top

Mr. Xcoder

18:52

CMC: Given a list of length higher than 2, output the two adjectant elements with the highest product.

Leaky Nun

it just has to theoretically work. it isn't code golf.

John Dvorak

@StepHen pfft

Leaky Nun

@Mr.Xcoder testcase?

Mr. Xcoder

[1, 2, 3, 4, 5, 6, 7, 8, 9, 7, 2] -> [8, 9]

John Dvorak

@Mr.Xcoder ->a{a.each_cons(2).max_by &:*}

Leaky Nun

18:54

@Mr.Xcoder and if there is more than one?

Mr. Xcoder

@JohnDvorak That was... fast

@LeakyNun You are guaranteed there is only one pair with the max product.

John Dvorak

Ruby is awesome

Leaky Nun

@Mr.Xcoder Jelly, 6 bytes: ,2\PÐṀ

Mr. Xcoder

Cool

Adnan

@Mr.Xcoder 05AB1E, 6 bytes: ü‚ΣP}¤

DJMcMayhem

18:56

@Mr.Xcoder Jelly, 5 bytes Try it online!

HyperNeutrino

@LeakyNun Could you explain what an adjacency matrix is? I want to try this if I can possibly.

Leaky Nun

@HyperNeutrino it is a square matrix with each row and column representing the vertices (so they are repeated once)

the corresponding entry is 0 if the two vertices are not connected

1 if the two vertices are connected

HyperNeutrino

Ah okay

Leaky Nun

so the main diagonal must be 0

HyperNeutrino

Ah I see.

So for it to be trivalent, the rows need to all sum to 3 each (and technically the columns) right

Mr. Xcoder

18:58

@Adnan 05AB1E has pretty syntax

HyperNeutrino

and it's symmetrical?

Leaky Nun

@HyperNeutrino yes

HyperNeutrino

Ah okay.

Leaky Nun

@HyperNeutrino an adjacency matrix must be symmetrical

HyperNeutrino

okay

How is the girth determined from an adjacency matrix?

Leaky Nun

18:59

that's the harder part

Mr. Xcoder

@DJMcMayhem Did you just outgolf Leaky?

Conor O'Brien

@Mr.Xcoder Probably golfable, but: J, 23 bytes: [:({~[:(i.>./)*/"1)2]\]

Riker

@Mr.Xcoder yes apparently

HyperNeutrino

In the Wikipedia page, what's with the adjacency matrix having a 2 in it?

oh because it has a loop

DJMcMayhem

@Mr.Xcoder Yeah, but I'm not sure how valid mine is because it can return multiple values

Leaky Nun

19:00

@DJMcMayhem very nice

HyperNeutrino

@DJMcMayhem It's guaranteed to not have to handle that

Mr. Xcoder

@DJMcMayhem You are guaranted there is only 1 pair of maximal product

Conor O'Brien

@HyperNeutrino if it took you that long to realize it, did you really have to ask in chat? >.>

DJMcMayhem

Oh cool!

@LeakyNun That means a lot from you :)

Mr. Xcoder

@DJMcMayhem @HyperNeutrino JHT?

HyperNeutrino

19:00

@ConorO'Brien because by the time I finished copy-pasting the link and writing up the post, I realized right after posting >.>

Adnan

@Mr.Xcoder as in character choice?

Mr. Xcoder

@Adnan Yep

Sherlock9

@DJMcMayhem It took me way too long but I updated my answer for the rolling question

Leaky Nun

@HyperNeutrino the slowest algorithm would be to look at the power set of the vertices and see which subset of the vertices forms a cycle

Sherlock9

Let me know when you can get the new official timing

HyperNeutrino

19:01

Ah okay.

Adnan

@Mr.Xcoder Thanks :)

Leaky Nun

@Sherlock9 long time no see

Mr. Xcoder

Is 05AB1E the golfiest stack-based language?

Sherlock9

Hey Leaky

Rough semester

Adnan

I think so

Conor O'Brien

19:02

@Mr.Xcoder MATL

Mr. Xcoder

@ConorO'Brien It's not always shorter than 05AB1E. Pyth is great and stack-based too

Conor O'Brien

...?

pyth is prefix

Adnan

Pyth is not stack based iirc

DJMcMayhem

@Sherlock9 Oh, cool! Link again? I'll probably get it sometime in the next 1-2 hours

Leaky Nun

pyke is stack based iirc

Sherlock9

19:03

Sorry for the onebox codegolf.stackexchange.com/questions/124654/…

Mr. Xcoder

Oh, yeh, sry

Sherlock9

Forgot about that

Been away for too long

Conor O'Brien

I think jelly is technically stack based

@Sherlock9 well, welcome back if you're staying!

Sherlock9

Depends on how bad next semester is :D

I've got a month

Got any good challenges?

HyperNeutrino

@Sherlock9 oeis.org/A000066

Leaky Nun

19:05

@Mr.Xcoder Python, 64 bytes: lambda a:a[max((a[i]*a[i+1],i)for i in range(len(a)-1))[1]:][:2]

Conor O'Brien

shameless self promotion but I think it's a pretty easy challenge

Mr. Xcoder

Nice

Leaky Nun

@ConorO'Brien somehow I didn't see that question...

Conor O'Brien

most of my challenges are popular for less than 24 hours unfortunately

Step Hen

@ConorO'Brien depends on how "HNQ" you can get them

Conor O'Brien

19:07

mine was on HNQ, didn't help much :P

I guess I need more clickbait :P

Mr. Xcoder

stackexchange.com/questions

Mine is second in HNQ rn

Conor O'Brien

honestly if I was in control of the HNQ I'd remove PPCG from it permanently. It only adds to what's wrong with this site

wizzwizz4

@ConorO'Brien Just Protect all of the things.

HyperNeutrino

ಠ_ಠ

Sherlock9

@ConorO'Brien While I love the idea, I get the feeling that I'm late to the party on that one

wizzwizz4

19:10

(For all you Wikipedians out there: semi-protect)

HyperNeutrino

1. that's not even possible ಠ_ಠ

Conor O'Brien

it's not answers I'm worried about, it's the voters who are like "ooo ~~shiny~~ obfuscated golfing language! Updoot and move on with my life."

Step Hen

@ConorO'Brien Problem is half of people on PPCG found PPCG because of HNQ

wizzwizz4

Anyone who knows Python and speaks Jelly, could you try to crack my CnR submission?

I spent a few days on it.

HyperNeutrino

@wizzwizz4 There's a reason this happens

Sherlock9

19:11

Though Actually doesn't appear to be on there yet, oddly enough

Conor O'Brien

@StepHen Yes, but those people represent a small amount of the people from HNQ, most just vote blindly and move on.

HyperNeutrino

what's CPython

I probably found PPCG through HNQ

Step Hen

Jul 26 at 0:24, by Dennis

@ASCII-only Embarrassing? I joined PPCG because of code trolling. >_>

Sherlock9

I cannot remember anymore how I found PPCG specifically

wizzwizz4

@HyperNeutrino What's the reason?

Is it to let new users on it?

Sherlock9

19:13

I remember I was trying to learn either Golfscript or gs2

HyperNeutrino

yes

Step Hen

@wizzwizz4 Community autoprotects it IIRC

HyperNeutrino

Community keeps autoprotecting it and then 3.5k+ users keep unprotecting it. :P

wizzwizz4

I know that.

Sherlock9

Oh, it may have been that I was looking for stuff on the Josephus problem, found an older challenge, and decided to post my variant to the site

And it all kicked off from there

HyperNeutrino

19:14

If sandbox didn't have antiautoprotect, it would face the same issue, except even worse :P

wizzwizz4

But why do they unprotect it?

Conor O'Brien

I think I got here by posting a programming puzzle on puzzling.se

HyperNeutrino

Probably to let new users answer it.

wizzwizz4

@HyperNeutrino I suppose the act of unprotecting is its own explanation.

HyperNeutrino

yes

Step Hen

19:16

@ConorO'Brien I guess they were all like "get off here go over to PPCG shoo shoo have a nice day"

Sherlock9

Conor, I would happily write an Actually answer to your question ... if at this point I hadn't completely forgotten what the Actually builtins are anymore

HyperNeutrino

I mostly unprotect it because other people did that :P

Sherlock9

Everything is a blur to me now

Conor O'Brien

@StepHen basically

lol

HyperNeutrino

@Sherlock9 that's what happened to me when I stopped practising jelly for about a month xD not as severe but I still forgot many things :P

Step Hen

19:17

@HyperNeutrino Wait, some people do more than Ctrl-F the Jelly wiki?

Sherlock9

I stopped practicing and I smashed my head against a wall for months

So things fell out of my head

Conor O'Brien

what kind of school do you go to

XD

Sherlock9

One where the finances are failing, the teachers no longer care, and the students despair of ever getting the promised degree

HyperNeutrino

@StepHen I remember many builtins, and back when my compose key still worked, I sometimes wrote whole programs without opening any wiki pages

Step Hen

@HyperNeutrino ... but isn't the whole language builtins?

HyperNeutrino

19:19

yes but the important part is knowing how to use the builtins correctly

wizzwizz4

@Sherlock9 That's a shame.

Sherlock9

It really is

wizzwizz4

Although, RE: that bit about finances: isn't that every school?

Sherlock9

My hope is that I can find time and money to get a master's degree in pure math

That would be amazing :)

Step Hen

@wizzwizz4 not one that's well endowed and has good financial managers

Sherlock9

19:21

Okay but the business model sucked from day one

wizzwizz4

@StepHen I have never seen a school that doesn't (need to) hold fundraisers.

Step Hen

@wizzwizz4 well fundraisers just mean they can charge less/some club can have some funding/the school's broke

Conor O'Brien

@Sherlock9 that sounds awesome :D

Sherlock9

We give lots of Indonesia's best and brightest minds scholarships to go to our school, and we'll hire PhDs to educate them and pay them really well by Indonesian standards

@ConorO'Brien It really does

Step Hen

@Sherlock9 double the taxes! triple the taxes!

wizzwizz4

19:23

@StepHen Tetrate the taxes to the nth degree!

Sherlock9

Okay, so the university wants to pay for a lot of research, a lot of PhDs, and have a lot of scholarships

In this scenario, where do we get the money since it's a private university?

Step Hen

@Sherlock9 endowments

Sherlock9

And I have never once seen a fundraiser

AND our endowment is okay but not enough to get through the first four years to have a graduating class

Step Hen

@Sherlock9 well... the hope is that you get endowments big enough that part of the interest goes the fight inflation and the rest is enough per year. But for that you need a lot of really rich sponsors...

Sherlock9

AND Indonesian law says you can't be accredited well until you have actually had a graduating class

DJMcMayhem

19:25

@Sherlock9 Quick question: What do I need to time your submission? Is it entirely self-contained?

Sherlock9

So it's been a train wreck for the past year and a half, and I'm so broke that I can't even buy the alcohol to have a drinking problem XD

@DJMcMayhem How did you time Anders' answer a month ago?

DJMcMayhem

I don't remember. It was a month ago :P

Sherlock9

Hm, his seems to be self contained and used the same method for timing.

I guess it works

Should we retime them both for fairness? we reran them at the same time sort of thing

wizzwizz4

@Sherlock9 I would recommend not having a drinking problem.

It eats your money, happiness and average statistical lifespan.

Sherlock9

Fair enough

Conor O'Brien

19:28

If I were you, I'd have a coffee problem. Much healthier :P

Sherlock9

But I would still like to be drunk at the moment

DJMcMayhem

@Sherlock9 When I rerun Ander's, I get 0.01 seconds difference. I don't think it's worth it

Sherlock9

Fair enough

Conor O'Brien

"But I would still like to be drunk at the moment" Sherlock9, 2017

DJMcMayhem

I've (re) added the official timing :) — DJMcMayhem just now

wizzwizz4

19:30

@Sherlock9 That will make you sadder.

Alcohol is a depressant.

Step Hen

I have to pay for college on August 1st, and I still haven't heard back about a scholarship (that was through the college) yet. 0.o

Sherlock9

@wizzwizz4 Again, fair enough

@ConorO'Brien Coffee can actually make me sleepier

wizzwizz4

@Sherlock9 I recommend sleeping or golfing.

Conor O'Brien

huh

Step Hen

@wizzwizz4 how bout both

Sherlock9

19:32

And I need more a mind occupier, honestly

@wizzwizz4 That's the ticket :D

wizzwizz4

@StepHen I don't have a brain-computer interface yet.

And I haven't worked out how to type coherently in my sleep.

HyperNeutrino

I don't have a brain ~~computer interface~~ yet

Step Hen

@HyperNeutrino yet?

HyperNeutrino

xD

idk I didn't get that either

Sherlock9

Conor, is the following an acceptable output for the percent sign challenge?

['10001', '00010', '00100', '01000', '10001']

Never mind, figured it out

New Main Posts

19:44

0

Q: Output a text that doesn't output any of the characters used in the instructions to output the text

Main objective The main objective is to output a text, it doesn't mind which text or where the text gets its output (it can be on a browser window, the default console etc). It just requires the condition that what is output must be indeed "real chars" (the ones in UNICODE for example), it's no...

string

Step Hen

@NewMainPosts This has to be a dupe of Output a googol copies of a string since anyone can just copy Dennis' answer for that, I think

@Mr.Xcoder ((10^100) * (10^100) * 3) / 4 is the ratio Dennis's answer would get

totallyhuman

that's nice

<Sequence [A003441: Number of dissections of a polygon.]>
<Sequence [A003442: Number of dissections of a polygon.]>
<Sequence [A003443: Number of dissections of a polygon.]>
<Sequence [A003444: Number of dissections of a polygon.]>
<Sequence [A003445: Number of (n-5)-dissections of an n-gon (equivalently, the number of two-dimensional faces of the (n-3)-dimensional associahedron) modulo the cyclic action.]>
<Sequence [A003446: Triangulated (n+2)-gons rooted at one of the triangles.]>
<Sequence [A003447: Number of dissections of a polygon.]>

oeis is weird

Mr. Xcoder

20:03

I don't worry about his god abilities, I think the challenge will be closed until he gets to answer.

Anyway, I capped :/

Bye!

Conor O'Brien

@totallyhuman I swear I saw this already

totallyhuman

i've been posting a lot of weird oeis sequence sequences sorry

it's just... they're soo weird o0

Step Hen

@totallyhuman The ones that are the same usually have different offsets

wizzwizz4

Which is better: a lower-fidelity brain-computer interface that's non-invasive or a higher-fidelity brain-computer interface that's invasive?

New Main Posts

1

Q: Products that equal a sum and vice versa

A fun pair of equivalences is 1 + 5 = 2 · 3 and 1 · 5 = 2 + 3. There are many like these, another one is 1 + 1 + 8 = 1 · 2 · 5 and 1 · 1 · 8 = 1 + 2 + 5. In general a product of n positive integers equals a sum of n positive integers, and vice versa. In this challenge you must generate all such ...

integer fastest-code

Step Hen

20:15

@wizzwizz4 one that can be turned off

wizzwizz4

@StepHen A non-invasive would be turn-offable by a switch, and an invasive would be opt-in at all times.

Conor O'Brien

the former

wizzwizz4

By opt-in, I mean that a set of neurons have to be firing in order for it to function other than checking those neurons.

@ConorO'Brien I'd definitely go with that too, at least until I had a few years to think it through.

Although it's relatively easy for non-invasive brain-computer interfaces to be designed for bots - just hook it up to some bytes in the running state.

Essentially the equivalent of an invasive for human brains.

Step Hen

Couldn't I have an external brain-computer interface, that I can initiate communications with when I want to, and push out when I want to?

wizzwizz4

@StepHen Yes.

Sort of.

Because it's low-fidelity, there'd be a high false-positive/negative rate.

A switch is easier.

An external brain-computer interface is pretty much just a hat full of electrodes.

Step Hen

20:21

You know, when I wrote this, I had some dumb feeling it would work...

def __getitem__(self, index):
    index %= len(self)
    return self[index]

wizzwizz4

An internal brain-computer interface is pretty much just a patch full of stabby electrodes for the brain.

@StepHen It would work.

Step Hen

@wizzwizz4 nope it recurses

wizzwizz4

You'd have to subclass list though.

Ah.

Step Hen

@wizzwizz4 I am subclassing list, still recurses :P

wizzwizz4

@StepHen super().__getitem__(index)

That wouldn't recurse.

Perhaps super()[] would work too.

Step Hen

20:23

@wizzwizz4 you mean on the return?

wizzwizz4

@StepHen Yes.

super()[] doesn't work.

Step Hen

@wizzwizz4 yup that works, thanks :)

New Main Posts

-1

Q: Finding duplicated element in linear time

DISCLAIMER: This is NOT a homework Hi folks, I'm studying a problem with a particular property that allows to solve it in linear time with O(1) additional memory. Here is the problem: Given an array "A" of size N with elements ranging from 1 to N, find the duplicated element in linear tim...

math

MD XF

20:54

Anyone want to contribute to Forked?

totallyhuman

how high is it on that language list of yours

MD XF

@totallyhuman which language list?

totallyhuman

on your profile page :p

MD XF

Ah

Yeah it's the top

Because it's going to be a lot of fun once I finally implement it

Wheat Wizard

21:54

Just wanted to let everyone know that the polyglot hit 100 languages today.

4

A: Add a language to a polyglot

100. brainbool, 2953 bytes #16 "?63(o?23!*# #@"/*\DZZCv;'[af2.q]PkPPX)\('#CO"14"; */ #/*0|7//```"` [>.>.])[-'][(>77*;,68*,@,1',;# l1011)(22)S\4n;iiipsddpsdoh coding:utf8ââââ(1P''53'S^'????!?!??!??!!!!???!?!??!!?!?!!!!!?!!!!?????!????????????????????!) (qx #>â # 36!@â` e++++++::@ #~ #y #`<` #<<<

6

totallyhuman

jeez

do you guys run every single language?

Wheat Wizard

Its been a long haul but we've made it to triple digits

@totallyhuman I can't run one of the languages personally but I've run all the other ones.

I'm 99% sure the language I can't run works though

Transcript for