The Nineteenth Byte

Redwolf Programs

00:13

SELinux is so annoying

Someone didn't get the memo that security at the cost of convenience comes at the cost of security...I'm like 10s away from disabling it permanently lol

Yaaay!

Finally got it working

I'm like 90% sure SELinux is a social experiment to see if people would rather have an unsecured system or jump off a building

user

What's so bad about it?

Redwolf Programs

Trying to do literally anything is very difficult, the documentation sucks, and the logging is very useless

It's like it's not written for humans to use

And googling for information on it isn't easy either

Since it gets drowned out by tutorials on how to do trivial stuff with it

Anyway, now I can start actually improving RTO's code now that I've got a running copy again

And oh boy is there a lot to improve :p

Starting with the fact that it will either respond or response to your actions, depending on what you do

thejonymyster

@RedwolfPrograms ohhh now i dont know anymore <(*_*)>

Redwolf Programs

thejonymyster

->X<- explodes

emanresu A

00:26

@user Wdym by this?

user

Like instead of a specific builtin to find lists, we could make a builtin to filter sublists by a predicate

So you would filter by "is list", then map each to its first element (because you'd have singleton lists of lists)

thejonymyster

like .filter(your function here)?

user

Do you want to discuss in the Vyxal room?

emanresu A

Sure

user

@thejonymyster I guess it would look like that in JS or something

thejonymyster

00:28

i am always just grasping for understanding in this big scary world ^_^

Redwolf Programs

@emanresuA Rejecting an edit and then making the same edit seems like an acknowledgement that the edit should be made, so why not approve it?

emanresu A

<!-->

thejonymyster

sorry lol i thought thats the only way to get a short edit in

Redwolf Programs

It basically is

@emanresuA Yeah but it still changed 27 to 28, so by opting to reject and edit instead of improving the edit, you're just preventing thejonymyster from getting the rep/stats

emanresu A

20 hours ago, by emanresu A

@thejonymyster For trivial edits like that, just comment

Redwolf Programs

00:31

But if the edit's already been suggested, there's no reason not to approve it

And SE policy supports minor edits IIRC

emanresu A

@RedwolfPrograms Sorry, forgot that happened.

Redwolf Programs

Nw, just for future reference

thejonymyster

tbh i dont get why rep is tied to that it seems a little silly

Redwolf Programs

I love how my laptop is muted, but I have chat open on my other laptop and it's not muted, so whenever someone pings me I hear it from the other room instead :p

lyxal

00:58

@RedwolfPrograms you sure that isn't just someone getting milk out the fridge?

emanresu A

Unless there's a portal between your houses, no

OldSandboxPosts

Sandbox posts last active a week ago: (untitled)

lyxal

Ah yes, (untitled)

The best name for a challenge

Redwolf Programs

Wait, does OSP not recognize <h3>s?

@cairdcoinheringaahing ^

caird coinheringaahing

02:07

@RedwolfPrograms It does not, only h1 and h2

I'll update it to recognise more header tags later

Fmbalbuena

@cairdcoinheringaahing why?

emanresu A

~~just teach it to recognise only plain text~~

thejonymyster

how about a program that tells you if the input appears in the src code

Redwolf Programs

Hi!

Fmbalbuena

@RedwolfPrograms ສະບາຍດີ

thejonymyster

02:22

@thejonymyster as a quine variant, it can probably be golfed a bit from a standard quine but idk

or maybe harder depending on the lang lol

emanresu A

`I$c`I$c in Vyxal

Redwolf Programs

@thejonymyster That sounds really cool

Could easily be a dupe though

thejonymyster

@emanresuA what's the accept/reject

emanresu A

Wdym?

thejonymyster

wait, what does that program do?

Redwolf Programs

02:25

Does that include `?

emanresu A

Checks whether the input's included in the code

`I`I is the standard quine, $c checks whether input's in that

Redwolf Programs

JS: i=>"i=>.ncludes()\\\"".includes(i)

thejonymyster

i must have copied it wrong because it was doing some nonsense when i tried it

emanresu A

@RedwolfPrograms Is it meant to do multichar strings

Redwolf Programs

Yes

Wait

Frick

emanresu A

02:28

Then includes fails

@RedwolfPrograms You have become Lyxal

Redwolf Programs

Hmm, without cheating this'll be hard

thejonymyster

nice

emanresu A

Does eval count as cheating?

thejonymyster

user opinion

there will probably be a "without eval" answer anyway

ill check if its a dupe first

and sandbox it if not]

Redwolf Programs

I think stringifying functions was rather recently agreed upon as cheating here

Idk about eval though

thejonymyster

02:33

im seeing a lot of ones based on individual characters

rather than an entire input string

New Posts

0

Q: Remove consistently dependent smaller integers

Consider this nested array [[1,2,4],[1,2,3],[2,3]] In each subarray in which 1 appears, a 2 appears. You might say that 1's presence is dependent on 2's presence. The converse is not true, as 2 appears in a subarray without 1. Additionally, 3 is dependent on 2, and 4 is dependent on 1 and 2. Task...

code-golf

caird coinheringaahing

@Fmbalbuena I'm bored

@thejonymyster Almost certain this has been do e

thejonymyster

02:49

probably

but like i really dont know how to search for it lol

theres so many ways it could be phrased

i guess ill check the quine tag

caird coinheringaahing

21

Q: Is it a substring of itself?

Given a string, return whether the string is a substring of the program's source code. Standard quine rules apply, meaning you cannot read your own source code. The length of the input is guaranteed to be less than or equal to the length of the program. You may return any two distinct values, no...

code-golf decision-problem quine

Huh, I posted it

thejonymyster

oh wow, no wonder youre sure lol ^_^ thank u

lyxal

@cairdcoinheringaahing no, you're caird.

thejonymyster

right yea i was never gonna find that specific wording

in fact that title isnt even accurate

caird coinheringaahing

@lyxal Yes, it's because I caird that I want to update OSP :P

@thejonymyster How so?

thejonymyster

02:51

replace "it" with "the input"

is the input a substring of the input's self

caird coinheringaahing

Who said both "it" refer to the same thing? :P

emanresu A

@cairdcoinheringaahing Your username was StanStrum?

lyxal

is that when you play a Dream fan like a guitar?

caird coinheringaahing

@emanresuA ...no

thejonymyster

@emanresuA no, theres someone named stanstrum in the thread lol

caird coinheringaahing

02:53

Stan Strum, San Diego, CA, United States

437 3 13

code-golf kolmogorov-complexity alphabet number string ascii-art decision-problem

emanresu A

Oops

Redwolf Programs

CMQ: A program whose source code contains every substring of itself

4

caird coinheringaahing

Huh, could've sworn Stan Strum had more rep than that

thejonymyster

maybe bounties

@RedwolfPrograms so any program :)

caird coinheringaahing

From what I remember, they had >10k, I think we'd notice that much rep given out in bounties

lyxal

02:55

@RedwolfPrograms every language: empty program

@cairdcoinheringaahing must be a different user then

Redwolf Programs

@cairdcoinheringaahing I google image search'd their pfp and it gave me "religion" lol

emanresu A

@lyxal What is this for?

thejonymyster

you could make a religion out of this dot png

lyxal

@emanresuA rep graph of stan strum

caird coinheringaahing

Wish I could search for users by profile pic, cause the Stan Strum I remember had a dog wearing a ushanka with a USSR flag in the background as the pfp

Redwolf Programs

02:58

Question about hash tables: If you have enough data, like hundreds of billions of items, wouldn't a hash table essentially be O(n / M), where M is the number of possible outputs of the hash function? And since M is a constant, it's basically O(n)?

emanresu A

Stanley O. Strum, La Jolla, San Diego, CA, United States

1

lyxal

@RedwolfPrograms depends on the hash function I'd say.

And also depends on how you handle collisions

user

@RedwolfPrograms The capacity of your hash table also matters

lyxal

Like if you use things like linked lists to act as buckets for duplicate collection, then wouldn't the complexity become the complexity of the linked list?

caird coinheringaahing

Ok, I genuinely have no idea if the person I'm thinking of even existed, cause I know they golfed in Pyth, but I can't find any trace of a multi-thousand rep user who holds in Pyth who I do t already know as "not Stan Strum"

Redwolf Programs

03:02

Did they have their account deleted, maybe?

caird coinheringaahing

Possibly

user

Because if your hash function is crap or your hashtable is tiny, all your items will be stuffed in one or two buckets (assuming you’re using buckets to avoid collisions), making it close to linear

lyxal

2 mins ago, by lyxal

@RedwolfPrograms depends on the hash function I'd say.

emanresu A

chat.stackexchange.com/rooms/132822/counting

Redwolf Programs

@lyxal Not really

hyper-neutrino

03:04

@RedwolfPrograms it depends a lot

every time you get a collision you increase the complexity of each lookup

user

If you’re not using buckets and are instead doing that thing where you hash it again or whatever and put an object with a collision at a different index, you’ll run out eventually

Wezl - a cautionary tale

@RedwolfPrograms If your hash items are approaching your hash range, you're probably either running out of memory or using a bad hash function

Redwolf Programs

@RedwolfPrograms Any hash function you'd use in practice is going to have a pretty even distribution

user

@RedwolfPrograms Perl had a hash function that looked at the length of function names. That would mess things up a LOT

caird coinheringaahing

Imagine not using an injection hash function

Redwolf Programs

03:05

@user For the use case I need, all the data would be 8 byte unique IDs

And there could be anywhere from hundreds to hundreds of billions

user

@RedwolfPrograms If you’re using your stdlib and you implemented your custom hashes correctly, sure, but if you don’t, you’re probably in trouble

Redwolf Programs

> implemented your custom hashes

Wait what

user

@RedwolfPrograms I’m just saying you can’t make a homegrown hash function and expect it to work

Redwolf Programs

Why would you do that

Aren't there well known and commonly used hash functions for this sort of thing?

user

Ye

lyxal

03:07

Depends on what you're storing

Redwolf Programs

So why would y'all be presuming that one of those aren't being used?

user

I mean like Objects.hash(field1, field2) in java

emanresu A

@user Vyxal, 0 bytes

It's even reversible!

lyxal

@RedwolfPrograms well what do you expect is being used?

user

Where you don’t want the default if it considers other fields

caird coinheringaahing

03:09

Basically rule 1 of the infosec.SE site is "don't make your own hash/encryption function"

user

Because sometimes you want the hash function and equality thing to ignore some fields and only look at others

Redwolf Programs

@cairdcoinheringaahing That's for crypto stuff, though. But yeah, still no reason to do so

user

But the body of your hash function should just be welltestedhash(foo, bar, …)

Redwolf Programs

I don't see why this matters?

I feel like we're talking past each other

lyxal

@RedwolfPrograms not necessarily - you might be able to write a more optimised hash function based on the characteristics of the data structure you're using

user

03:10

@RedwolfPrograms Just trust in someone else’s implementation without worrying about it too much :p

Redwolf Programs

?

caird coinheringaahing

@RedwolfPrograms If M >> n, yes

That's "much larger than", not bitshift

user

@RedwolfPrograms I wanted to clarify that by “custom hash function “ i didn’t mean “make your own new function” because that would contradict what I said before

@cairdcoinheringaahing which is usually true

Redwolf Programs

Problem is, I don't know how many of these IDs there will be. It could be anywhere from hundreds to hundreds of billions.

user

That fits in an int, right?

lyxal

03:12

I think the point is that the complexity of the hash table depends on the complexity of the hash function

Redwolf Programs

@user An int holds up to 4 billion or so

user

Oh

Redwolf Programs

But that would mean allocating 4 billion items, even for a few hundred IDs

user

Oh boy you need a database and some sql :p

hyper-neutrino

uh

who said M is constant

Redwolf Programs

03:13

Wait it can change?

lyxal

@RedwolfPrograms Modulo the ids by a smaller number and use buckets

hyper-neutrino

or rather

M isn't really the number of outputs of your hash function

user

@hyper-neutrino why wouldn’t it be?

hyper-neutrino

it's your hash output modulo the bucket count which can be dynamic depending on your implementation

Redwolf Programs

@lyxal I thought user was suggesting having 4 billion buckets (one for every int value)

user

03:14

@hyper-neutrino it’s the domain, right? Or is it the codonain?

hyper-neutrino

co

well yeah if you want your hash table to not be either really inefficient in space or really inefficient in time

caird coinheringaahing

@RedwolfPrograms Then use an M much larger than the largest possible n

hyper-neutrino

you need to be able to alter the number of possibilities

user

Oh yeah it resizes

Redwolf Programs

@cairdcoinheringaahing Which means a ridiculous amount of space usage in 90% of scenarios

hyper-neutrino

03:15

yeah

and each resize is O(n)

user

Frick

hyper-neutrino

but overall, it amortizes to O(1) for everything in the average case

Redwolf Programs

I feel like a BST would just be simpler lol

caird coinheringaahing

@RedwolfPrograms Who cares about that, is the code short? That's all that matters :P

Redwolf Programs

lol

user

03:15

@RedwolfPrograms bst is log right? V big

Redwolf Programs

log(100000000000) is like 20 :p

user

How about a list of buckets containing bsts?

caird coinheringaahing

I will gladly accept an algorithm with complexity O(TREE(n)) if it saves bytes

user

@RedwolfPrograms oh true

hyper-neutrino

bst is log for everything

sure, log is very small, but it's still a constant factor of like 20

also bsts require strong ordering

user

03:17

But you can get close to linear with hashtables still i think

hyper-neutrino

which i suppose is fine if you just order by hash

user

@hyper-neutrino yeah insertion is a problem

lyxal

@user use heaps then

caird coinheringaahing

I wonder if there's any algorithm who's complexity involves g_n(x) (the iterated function used in the definition of Graham's number) for some n, x

hyper-neutrino

how does using a heap help

user

03:17

@RedwolfPrograms is there no way to find out how many ids there’ll be?

hyper-neutrino

they're also log and don't even serve the required functionality

Redwolf Programs

@user The number will change a whole bunch over time

lyxal

@hyper-neutrino no storing order though

hyper-neutrino

@cairdcoinheringaahing for i in range(g_n(x)): print(i)

user

@lyxal heaps are binary trees still

caird coinheringaahing

03:18

@hyper-neutrino Hmm yes clever

hyper-neutrino

@lyxal heaps also don't support arbitrary membership

caird coinheringaahing

How about a non-trivial example? :P

user

@RedwolfPrograms oh too bad

You seriously need a database

Redwolf Programs

Well for what I'm talking about, all I need to store are a bunch of 8-byte unique IDs

So ordering isn't an issue

hyper-neutrino

@cairdcoinheringaahing for i in range(g_n(x) + 1): print(i + 1)

user

03:19

And just let sql handle it

caird coinheringaahing

@hyper-neutrino This is still trivial :P

hyper-neutrino

@RedwolfPrograms exactly how many are you going to have to deal with and how much of an issue is efficiency

also what language; can't you just use a built-in set type or smth

user

You don’t even need sql

hyper-neutrino

@cairdcoinheringaahing what if i made it +2

caird coinheringaahing

@hyper-neutrino Now we're talking

If you're really crazy, make it +3

lyxal

03:20

@RedwolfPrograms so why not just use a standard list? Finding an ID is just a linear search then

Redwolf Programs

@hyper-neutrino Probably, this is likely just theoretical

user

@cairdcoinheringaahing oh no, higher math

Redwolf Programs

@lyxal Linear with billions of items? That's the definition of performance right there :p

lyxal

@RedwolfPrograms what's the context?

user

@lyxal it aint linear

Aset is just a hashtable in disguise

Well it depends on impl

Redwolf Programs

03:21

@lyxal Needing to be able to really quickly determine if an ID for something is unique, and then add the ID to the list of IDs

user

How are you planning to implement this currently? Which language are you using?

caird coinheringaahing

@user Anyone who uses numbers larger than pi is mad

Redwolf Programs

How did my NAA flag on this get declined...

caird coinheringaahing

Also applies to numbers less than -1

user

@cairdcoinheringaahing totally irrational to do that

Redwolf Programs

03:23

@user Idk, it's entirely theoretical at this point. C, JS, brainfuck, it's up to you.

user

Brainfuck pls

:p

emanresu A

@RedwolfPrograms Flagged aswell, hopefully someone else picks it up

user

If you value your sanity tho don’t use C

Use Excel or MS access :p

Redwolf Programs

I'm perfectly fine with giving my future self really difficult tasks, I hate that guy :p

caird coinheringaahing

@hyper-neutrino Why was my "no longer needed" flag on this declined? The explanation was added, then I raised the flag

user

03:25

@RedwolfPrograms careful, you don’t want future you coming back to beat up present you

lyxal

@user no no use befunge and store the ids in the program

Befunge98 obviously

emanresu A

@lyxal No use malbolge and...what

lyxal

@lyxal befunge93 restricts the size of the code board meaning it can't store all the ids lol

Plus if you ever need to quickly burn all the ids, you just stop running the program lol

hyper-neutrino

TBH just don't bother determining if the ID is unique

just use a large enough space that it's nearly impossible to have overlap and just assume you're fine xd

alternatively just depend on the timestamp

Redwolf Programs

@hyper-neutrino I would just do that, although for the use case I'm thinking of the IDs are user supplied so a malicious user could intentionally supply a dupe

hyper-neutrino

03:32

oh

Redwolf Programs

But I'll probably just go for a hash table I guess, from google it seems like the main advantages of a BST would be if I also needed to search within ranges, which I shouldn't

(Of course this is theoretical, for the project I'd use it in, I wouldn't actually write any code for a long time)

hyper-neutrino

bsts are mainly used if you need to search for the index of something

hence why it is called a binary search tree :P

Redwolf Programs

For the RTO prototype, I'm going to have JS and Python. In addition to Ruby, Haskell, and Java, are there any other languages I should add?

lyxal

@hyper-neutrino exactly. Just let everyone use the same ID :p

Redwolf Programs

(I'll be adding Jelly and Husk too, on top of Python and Haskell)

hyper-neutrino

03:36

@lyxal ಠ_ಠ

lyxal

Like make it so that 69696969 is the only id

Redwolf Programs

That dilutes the intrinsic humor of 69 though

emanresu A

VYXAL

Redwolf Programs

Something like 169420 is considerably funnier, don't you find?

@emanresuA That would be on top of Python, not its own base language

But good idea

I'll add that to Jelly and Husk

emanresu A

Oh ok

C/C++?

Redwolf Programs

03:38

Good idea

I'm wondering if I should run C/C++ on Alpine, or a full Debian install

lyxal

@RedwolfPrograms that 1 at the front ruins it

@RedwolfPrograms elixir so you can add 05ab1e

And obviously, Scala

Can't forget Scala

Redwolf Programs

Alpine uses a different libc, so I'm worried it would break some extremely niche answers that rely on ultra weird behaviors of glibc

lyxal

Also APL

Redwolf Programs

@lyxal Elixir will take more than five minutes to install, so not worth adding to the beta

Wait actually, there's an elixir:alpine image

So I'll add it

user

@RedwolfPrograms Scala :)

lyxal

03:41

1 min ago, by lyxal

And obviously, Scala

1 min ago, by lyxal

Can't forget Scala

Redwolf Programs

Sorry, no scala in the beta.

lyxal

@user I ninja'd you twice.

Redwolf Programs

It's in the 35 though

user

Okay but has anyone suggested Dcala 3 yet?

lyxal

Ooh ooh add nibbles in the beta - it's made in Haskell and would be a good representation of the non-sbcs non-utf category

user

03:42

:p

Maybe Prolog (if you add prolog you cam add brachylog)

Redwolf Programs

This is a beta, I'm only adding the bare minimum for testing purposes

user

Ah

Redwolf Programs

@lyxal Y'know, I also have a non-SBCS non-UTF language that's written in one of the base languages being added to the beta :p

hyper-neutrino

ok so for context, i am making a discord bot, and the commands are all individual functions that are loaded into the command registry via a decorator

errors that are thrown out of the command functions are all caught by the message handler and relayed back to the user

how stupid or bad of an idea would it be to have a "success" error type and throw that and have the handler format and return the response to the user?

Redwolf Programs

Sounds like it could be a good way to reuse code/save time

Sort of like how you could use STDERR in a lower level program as a form of output instead of STDOUT if it made things more convenient (like what timeout does)

hyper-neutrino

04:01

hm, i see. is throwing and catching errors inefficient?

Redwolf Programs

If you mean as in speed, I wouldn't think so, and for a discord bot it doesn't seem like the milliseconds-at-worst difference would matter

user

@hyper-neutrino Ye i think because you rewind the stack

Or sth

*stacktrace

It depends how often you throw en i guess

hyper-neutrino

well the frequency would be every time someone calls a command

so yeah ig the efficiency shouldn't matter much if it's just like a couple milliseconds at most

i'm more so wondering if it's bad code style or smth tho lol

Redwolf Programs

I wouldn't call it bad, just maybe unconventional

What I'd be more likely to do is just put the formatting in a function and call it in one of two places, once in the catch block and once if it succeeds

hyper-neutrino

hm, that'd make sense too

currently i have a function that sets the embed's color to the server's default color and for success-type messages like mod actions i just manually make it green

a lot of code reuse that i've been too lazy to properly address but i was mostly rushing it to meet a deadline, and now i can go back and fix something up

user

04:45

@hyper-neutrino is there no better way to do it? Is this what other bots do too?

hyper-neutrino

@user well i could just reply to the user and then return

which is what i currently do

but there's a good amount of code repetition, which i should fix either way, whether like this or with the alternative redwolf suggested

i don't actually know how other bots work; i haven't looked at other bots' code before

i only have experience from writing my own bots and looking at the documentation/reference, lol

user

Ah ok

emanresu A

06:36

@pxeger How do you do timeout in zsh?

(Doing this in Vyxal #forthememes)

pxeger

you mean how do you run a command with a timeout?

just timeout 60 command args ...

but timeout is a separate binary so command has to be simple. You might need timeout 60 zsh -c 'command args ...'

emanresu A

pxeger

macOS?

brew install coreutils

emanresu A

Thanks

pxeger

and then use gtimeout

emanresu A

06:44

Now I just have to figure out how to run Vyxal 2.4.1

lyxal

07:06

Now see imma gon have to stop you there. You probably got the 2.4.1 release thinking that's what the old site runs

But it ain't

The old site runs something between 2.4.1 and 2.5

null

Question: How to get better at 05AB1E? (Means you can write reasonably long program in reasonable time that is not a week)

--

I think I saw someone... @lyxal

@lyxal

lyxal

I'm here

And the answer is practice

Practice using stack manipulation stuff

null

IK

lyxal

Learn the built-ins list

null

I'm just going to say

(|111+")(|""+*"*+)+";1111++"( |"+"*+"++;)()1+( )()+"""++;()"""+"";^"();()"+*"+;\;()++"""++;;""1+"+"+"+";1111++""""+++"1+;;()"+"*+;;()"+"**+"";;

(nvm)

@lyxal but how

memorize it?

lyxal

07:16

Get familiar with some of the terms

You don't have to memorise it word for word

You just have to have a vague idea of what exists so you can search for what you want when you want

null

Oh

@lyxal Like I start getting into perfectionist stuff

e. g. implement exp by sqring

Store n and m and base and mod and ans in the stack

then this happens: ŠŠ....À...

--

Since I give up 1+ and use other languages, ` ^!!LAXYL KCAB EMOC(@)`

emanresu A

08:02

It’s basically Vyxal with worse docs

@lyxal I just need 2.4.1 ‘cos W clears the stack, doubling the speed of my program

pxeger

08:15

Some of you may be interested in this set of Jelly puzzles by Lynn: foldr.moe/jelly-puzzles

hyper-neutrino

oh i totally forgot about that

emanresu A

I made a Vyxal version of those

Warning: hard

emanresu A

08:43

TIL Safari has a URL parsing bug for # in dataurls

pxeger

08:54

Safari? URL parsing bugs? Never...

pxeger

09:15

@pxeger Wow, I just solved 44...

emanresu A

Nice! Did you see my answer to the recursive prime thing or figure it ou yourself?

> as a workaround we can crash the browser once we detect the attack

pxeger

@emanresuA ?

I'm talking about the Jelly ones

emanresu A

Oh.

Welp I’ve given away that one I guess

pxeger

> The puzzles are very roughly sorted by difficulty.

This is quite rough, although I guess it depends on who's solving them

emanresu A

I saw :p

pxeger

09:27

because #45 took me about 1 minute, and I spent at least 10 minutes on #44

Wheat Wizard

09:53

@cairdcoinheringaahing It's really not certain to me that this type of "explanation" which just explains each of the constituent parts is enough to make the OP understand the answer. If they said something along the lines of "Thanks that helped!" I'd clear things up.

pxeger

I don't think anything there needs much more explaining. Maybe "the digits are invariant under sorting", but I think that's not too hard to work out either

New Posts

12:48

0

Q: Can I shorten this Python code?

I am trying to write a solution to the following problem using as few characters as possible (to meme my friend and introduce him to golfing). Can any improvements be done to my code? So the problem requires us to write a function called navigate in Python 3.6 (language of the judge, sorry, no wa...

code-golf tips python

lyxal

@NewPosts by at least 3, probably

pxeger

13:23

(python): is there a shorter way of converting a complex number in [1,1j,-1,-1j] back to its exponent of 1j? I've got [1,1j,-1,-1j].index(d)

pxeger

13:37

@NewPosts (what is this, someone who read the help center??)

I also wish I'd edited the title and tags before I answered, to make some progress on Reviser...

pxeger

13:57

Refiner*

Transcript for