The Nineteenth Byte

Dennis

00:00

@DJMcMayhem S is a shorthand for +/, + vectorizes, and dyadic vectorization is the archenemy of performance. :/ ḅ1 gives a decent 0.6 seconds.

Downgoat

@ASCII-only why is this be happen:

vsl::asts> foo.bar { gaot }
Syntax Error: Unexpected token `{` (1:8)

    > 1 | foo.bar { gaot }
        |         ^

ASCII-only

:/ idk

can you update c9 with latest pls

Downgoat

@ASCII-only :/ sounds hard

will try

ASCII-only

@Downgoat or like gist the nearley

Downgoat

@ASCII-only github.com/vsl-lang/VSL/blob/develop/src/vsl/parser/parser.ne

@ASCII-only okay cloned on c9

DJMcMayhem

00:06

@Dennis What does ḅ do?

ASCII-only

@Downgoat it should parse as Property CommandChainPartHead[Closure] right?

Dennis

@DJMcMayhem Base conversion (list to integer).

Downgoat

@ASCII-only no

command chain are borked so doesn't

ASCII-only

:/

Downgoat

im not sure whats going on with c9

ASCII-only

00:12

@Downgoat nvm. so what should it parse as?

Downgoat

@ASCII-only Property Closure

ASCII-only

@Downgoat but there's nothing in grammar matching?

Downgoat

@7H3_H4CK3R no, regexi

ASCII-only

@Downgoat no that is plural of regexus

Downgoat

@ASCII-only should I have modules be specified in module.yml? That way you don't need to recompile every module, everytime

ASCII-only

00:22

@Downgoat probably

Christopher

00:33

for this challenge of mine I think using the brain-flak integer metagolfer may help. Just do the first char with the metagolfer and then for each next char dupe the last one and sum the difference you needed found by the metagolfer

It could make you win easy

ASCII-only

@Christopher uhh no?

what if creating the number from scratch is golfier

Christopher

@ASCII-only Since your score is not based on bytes for your code but for the output the extra length doesn't matter

ASCII-only

@Christopher ^^

please read.

Christopher

@ASCII-only check if it is and compare

think about it

ASCII-only

@Christopher and what if there exists a function that returns multiple correct stack values?

Christopher

00:36

@ASCII-only what about it

in brain-flak almost always it is golfier to just do a small number to adjust a larger number rather then just dumping the old number and creating a new one

almost is key, multiples of like 2 and such are very golfable

ASCII-only

@Christopher yes? i meant what if there's a way to return like half of the string with 20 bytes

when it would normally take 300

Christopher

@DJMcMayhem you have to answer the B-Flak string golfer :P

@ASCII-only Yeah

the longer inputs are going to be the actual test of it

ASCII-only

@Christopher also IIRC bfi is partially broken

Christopher

@ASCII-only bfi?

I was talking about the challenge not the website lul

ASCII-only

@Christopher brain flak integer golfer

@Christopher yeah but the website is clearly superior in terms of golfiness :P

Christopher

00:39

@ASCII-only yeah you can do that

point remains

I think that people are approaching from the wrong side. Lots of golfing of their code going on for some reason :/

I like clean readable code people! That is why I like code-challenge

ASCII-only

>_> <_< maybe you didn't make it clear enough

Christopher

code-challenge

not code-golf

@Everyone read tags before u golf

ASCII-only

@Christopher well... tags are the least visible part of the question?

Christopher

@ASCII-only I see them first :P

ASCII-only

@Dennis hmm would having wrapper types for gmpy2 numbers be too much overhead to make the switch worth it?

Christopher

00:42

added a note

Dennis

@ASCII-only Compared to what? Plain native types or native types in a similar wrapper?

Christopher

@Dennis half the stuff I read you say is funny and the other half i don't understand. :P

ASCII-only

@Dennis compared to equivalent types implemented in Python >_>

Dennis

Hard to say. mpq is a huge performance gain over Fraction, but mpz is already slower than int if the numbers are small enough.

Christopher

Interesting

Zacharý

01:03

What is the point in mpq and mpz if there are already integers and rationals in Python?

ASCII-only

@Dennis >_> I implemented rationals using Python ints so I'd assume the difference would be massive then?

Dennis

Probably.

Zacharý

@ASCII-only THAT would be massive... holy crap

Dennis

@Zacharý Taking the sum of the multiplicative inverses of the first 10000 positive integers takes almost 4 seconds with Fraction, yet 0.06 seconds with mpq.

Zacharý

And mpz??

Dennis

01:09

Useful for big integers.

Zacharý

Isn't int arbitrary precision though?

ASCII-only

@Zacharý yes?

Dennis

That doesn't make it any faster.

ASCII-only

@Zacharý but mpz is faster for numbers > 20-50 digits

Zacharý

Ah... didn't see the italicized "big"

(I saw "big", just didn't notice the italics >_<)

ASCII-only

01:11

@Dennis hmm it seems like a wrapper would be a lot of overhead though

Dennis

Unless you write your wrapper in C, probably.

What are you trying to accomplish with this wrapper?

ASCII-only

mostly basically operator overloads with user-defined classes

It probably would be a good idea to just implement all of it in C though

Dennis

Related types (e.g., all numbers) or things like + is addition but also concatenation?

Because, e.g., mpz(10) + Fraction(10, 1) already works and dutifully returns mpq(20).

ASCII-only

I'm planning to port all numbers to GMP types, it's more for things like symbolic variables and expressions (of unknown type) - this is so the expression can be evaluated to the specified precision

Dennis

Uh, implementing a symbolic type in Python is going to be slow.

Zacharý

01:20

Sympy? (I heard symbolic)

ASCII-only

@Dennis Yes it is >_>

Another thing: when doing floating point operations is there a way to find out the loss of precision

Zacharý

Compare it with the arbitrary precision result?

:p

ASCII-only

Or rather is it possible to calculate the needed precision of the operands given the result precision

Dennis

Well, sure. Unless you're dealing with simple expressions, that's far from trivial though.

ASCII-only

:/

@Dennis could you possibly link relevant information?

Οurous

01:26

I have no idea why tio.run/##S8ksKqn8/9/QAAz0HrVPN6jWrlX8/x8A breaks. Specifically, no idea why it breaks with a stack overflow. The interpreter handles infinite loops fine, and it can sum larger ranges of numbers. :/

ASCII-only

01:38

looks at gmpy2 source

ok clearly porting to C will be a lot of work

I guess I'll have to live with inferior performance for now (and try to optimize calculations/add special cases etc. instead)

@Dennis could you link to any info on calculating needed precision?

Dennis

Can't really think of a resource. I took numerical calculus course some 14 years ago...

micsthepick

02:05

Ever since I discovered that my laptop has a contactless smart card reader I have been trying to get information off some of the cards in my wallet

Dennis

@Οurous That's weird. Almost all computation time is used by the garbage collector. It doesn't happen if you don't print the result.

Zacharý

SO you could say that the garbage collector ... COLLECTS ... almost all of the computation time?

Pavel

02:28

No.

Zacharý

Yeah that pun was kinda GARBAGE (I'll stop now)

HyperNeutrino

wtf

Dennis

shouldiblamecaching.com

HyperNeutrino

yes :P

@Dennis the weirdest thing is that the inaccuracy caused by caching isn't even consistent. like on the same page they load data from two different places? preposterous

Dennis

→ 8 messages moved to Trash

@HyperNeutrino That happens everywhere though. Your rep count in the top bar is updated automatically, but those on your user cards and your profile page are not.

HyperNeutrino

02:42

hm weird. ok I guess that might make sense for such a large-scale server (though I still find it weird and it seems easily fixable lol)

but i'm not a server admin/dev so I won't judge how they do things :D

Οurous

@Dennis yeah but the wierd thing is that after GC the heap doesn't need to grow, and uses the same ammount (cycling up and down a bit) as before.

Might be a partial application problem.

Dennis

Seeing how I know neither Clean nor Dirty, I probably won't be able to help.

HyperNeutrino

did you actually make dirty compile to clean and call it Janitor? :D

Οurous

@HyperNeutrino it's interpreted at the moment, but that is the eventual plan, yes.

HyperNeutrino

ooh ok :D

Οurous

03:07

@Dennis Fair enough. If you want to see something really strange, doing the same thing using the main stack works fine: tio.run/##S8ksKqn8/9/QAAz0DKINyw8tPLRf@9HajYf2P@pcEGtYrvj//7/…

... but not on the windows version? which should be identical.

This isn't going to be fun to fix.

okay so all I can really deduce is that anything that jumps the IP reveals something important not tail-calling.

Manish Kundu

03:26

I am ready to post this codegolf.meta.stackexchange.com/questions/2140/…

Any last minute suggestion

Anonymous

@cairdcoinheringaahing This article reads like a post on the SCP wiki

Riker

^

Pavel

I can't get into SCP because there's no structure or order to follow, but a few of the entries are really intresting.

Anonymous

@Pavel There's a bunch of long-form content

New Main Posts

0

Q: Help John watch movies!

Introduction So John finally has his holidays! And what better could he do than watching some movies. He indeed has a lot of movies to watch, but he is unable to decide which one to watch first. He has a list of movies, each in the format: <Movie name> (<Year>). So he makes a simple set of rules...

Steven H.

03:37

@ConorO'Brien I think that's an old version that got saved... derp. fixed version is 46 bytes

Manish Kundu

Wow that was fast. I had just posted it.

Downgoat

04:47

@ASCII-only wait what

Pavel

I too am intrigued by whatever that is

ASCII-only

@Downgoat hmm?

@Pavel what conversation is this continuing from

Pavel

I have the same query as Downgoat

Who is this
Shog-Niggurath, The Black Goat of the Woods with a Thousand Young

Downgoat

yay vsl libc works:

<input.ll> -> .vsl-temp930bb791.o
.vsl-temp930bb791.o -> <output>

Succesfully compiled in 41.42ms

actual compilation time is not 41ms. That is file writing + ld time

Pavel

Can has TIO link?

ASCII-only

05:00

@Pavel Shub-Niggurath of the Great Old Ones (Lovecraftian mythology)

Pavel

Ah

(Then who is The Black Goat of the Woods with a Thousand Young)

ASCII-only

One of her titles

Pavel

I see

ASCII-only

06:16

I wonder how Mathematica figures out required significance for calculations - do they just calculate increase significance of the operands iteratively until the significance requirements are met?

user202729

06:33

-4

Q: Tag Request : `golf-jelly`

I have a question concerning how one of the operators in Jelly works (the G monad in particular, but that's irrelevant). I noticed there isn't a tag for it, and that I have much too poor a reputation to add a tag myself. Since there already is a tag for a language of the same name, I'm assuming t...

feature-request tags

Pavel

@ASCII-only When forced to use non-infinite precision Mathematica uses standard double precision floating point numbers.

ASCII-only

@Pavel but they have arbitrary precision though?

@Pavel like you can do N[calculation, 10000]

Pavel

Right. But if it has to coerce to a numeric value without the use of N, you can get either a Double, and Int32, or a BigInt.

ASCII-only

@Pavel Won't that mean it will have error

Pavel

That's why it generally doesn't do that and sticks to infinite precision

ASCII-only

06:43

What about things like 1/3

ASCII-only

06:57

@Pavel

Pavel

1/3 evaluates to 1/3

It doesn't get converted to a limited-precision form

That's like the entire point of Mathematica

ASCII-only

yeah but what about when you're using it in limited-precision calculations?

Hmm

never mind

Soaku

08:07

Google Translate doesn't like me

ASCII-only

Python always tries __sub__ before __rsub__ right?

@Soaku nice

Soaku

@ASCII-only thanks ._.

user202729

08:49

(TIO auto tab script)

https://tio.run/##jVJNT@MwEL37V4yyCCXQTVs4Qk/AAS0SEnBb9mDicePFHUf2tGwX@tuLnY9SxIVcEr@PeS@T/JUrGSpvGv5JTuF2Ox7DhWvWIElBIwMjcG0CGGIHl7hC6xr0UULBWRRCL6li4wgWThlt0Ic8iogLeBUA4JGXnqCFSmn5F67h/BxO4a3HKva2B08iCMnUMQtk2TPTnTzURqchZ2IDsSkhKnhC5lgpNsS5l22ZF8M1PFzflmUpxEp60DCDoWpfsO1nNORfms9mMIHDwz7yGdcXcTMJnZ72rxWvNHUl7TIS7YbK9lAGayrMJ6MOC2ixzbxn6bk42/PauNsbQ8m@7@yeE3lNCv/d6jx7pKyAY5ju2VPs8QwSFZlhVLmQXNX5@DEcjYvfkz@D/qPeEBZNXzp/LnxFqvjkD8j3A3knab6rijTnegT7p52z22Dj2/slarm0nO9Yj8H874I7bCM2Qhzk2Y8qLjwrSqnUVXLemPgfEvo8ix9DuRfKRqCjJUlrlAr9N8XaOf6OeLt9Bw

Soaku

auto tab?

iBug

hello folks

is PPCG a graduated site?

Soaku

yes

iBug

if yes, why are the rep requirements same as public beta?

Soaku

idk

PPCG is a different world

iBug

08:59

has anyone ever played the game "Human Resource Machine" by 2D Boys (same developer as World Of Goo)?

that's good for a recreational language :)

Soaku

I only played WoG and the chimney-thing game

iBug

never heard of "chimney-thing" or such...

HRM is a game that you use an assembly-like language to program very simple things on a Harvard architecture "machine" (separate data RAM and instruction RAM)

the assembly is very simple and I think it's good to be used as a recreational language

Soaku

you made me instantly buy it

iBug

wow, rich guy :)

google searching for images found me this question on MSO:

118

Q: Can I ask about assembly programming in the game "Human Resource Machine"?

Update: The comments and answers here made me realize there's a more general question to be asked, so I asked about video-game language questions in general on Meta.SE. There's a Steam/iOS game called "Human Resource Machine", where you solve levels and advance by programming in a proprietar...

discussion scope

By the way, do all submissions have to count in bytes in a typical [code-golf] challenge?

Soaku

No, there was somewhere a discussion about this I think\

iBug

09:10

I like it when assembly-like languages can be counted in "ops"

NieDzejkob

played it. good game

If you like it, you could also like TIS-100

iBug

For example, a simple HRM program that swaps every two inbox items would be 7 ops long, or much longer if counted in bytes

a:
INBOX
COPYTO 0
INBOX
OUTBOX
COPYFROM 0
OUTBOX
JUMP a

micsthepick

09:32

you can make it faster

(at the expense of making it much much longer)

@iBug where are you up to?

NieDzejkob

11:05

@user202729 "It's provable (see HyperNeutrino's answer for a more detailed proof) that, there exists a transformation rule if and only if there exists a nontrivial prime factor of X that is congruent to 2 mod 5." Where's the "only if" in Hyper's proof?

Beta Decay

How do you think I could go about making 4x4 regexcrossword.com generator in JS?

user202729

11:54

@NieDzejkob That's why deleted. But it's true...

@Soaku should be auto indent...

Soaku

12:17

works

ASCII-only

12:40

@iBug Yes

@iBug Pretty boring, I could implement it if you really want

@iBug They'll be changed when we get a design

@NieDzejkob Not that similar tbh

@BetaDecay just have some basic patterns and generate until you have a puzzle with at least one valid solution :P

@user202729 turn it into a userscript

actually

Just use GoaTIO

if it is still a thing

caird coinheringaahing

@iBug We don't yet have a design, which is what changes the rep boundaries, not graduation.

NieDzejkob

13:02

@ASCII-only yes, I know

ASCII-only

@NieDzejkob TIS-100 is like 12×HRM

@micsthepick lol I did that

user202729

13:28

@ASCII-only What's that?

ASCII-only

@user202729 Downgoat's TIO interface, it had a code editor (but no keyboard shortcuts to get links/ctrl+enter to run)

user202729

@ASCII-only But TIO already have that. (or is that a different page and just send POST request to appropriate ~~address~~ URL?)

ASCII-only

@user202729 Yes.

user202729

(is using "address" correct here?)

Dennis

@user202729 vihan.org/p/tio Same backend, different frontend.

user202729

13:41

Can anyone explain why this message is starred?

NieDzejkob

@user202729 Apparently people find it interesting that there was a time such that toy kit nuclear reactors were sold

ASCII-only

@NieDzejkob fun fact: there were actual particle accelerators using bubble chambers as detection instruments

Dennis

@user202729 Because it refers to a time where toys contained actual radioactive materials as the good old days. Sarcasm is always welcome on the starboard.

NieDzejkob

@HyperNeutrino SE maintenance?

caird coinheringaahing

Nevermind

Dennis

13:51

That wasn't a question. It was a guess to HN's riddle.

New Main Posts

14:37

0

Q: One-line implementation of split in Haskell

What I want is the following one (which I think should be included in prelude since it is very useful in text processing): split :: Eq a => [a] -> [a] -> [[a]] e.g. split ";;" "hello;;world" = ["hello", "world"] Which is already implemented in Data.List.Utils, but this is not always availab...

haskell

user202729

Problematic case. Any user can post a "gimme teh codez" question on PPCG and just tag it as [tips] and...

caird coinheringaahing

No they can't. We're smart enough to realise the difference between a legitimate tips question and a "gimme teh codez"

user202729

Yes, we are smart but I'm not sure the site rules allow that.

caird coinheringaahing

@user202729 Allow what?

user202729

I'm not sure. But it seems weird...

Do we have the rule that "all tips questions except "Tips for golfing in <language>" must show existing code which is already a serious contender"?

But... the OP can post a challenge with ... and then hope that there is a Haskell answer?

(the builtin is shorter anyway)

... anyway, whatever they do, they won't get useful answers. Hopefully.

user202729

15:26

in Of Monads and Men, 4 mins ago, by user202729

Can anyone explain what's the <- in the guard?

feersum

I don't know Haskeel but it looks like an assignment.

NieDzejkob

@feersum isn't haskell like purely functional?

user202729

Yes it is.

Anonymous

16:41

@user202729 <- acts like let: temporary assignment in pseudo-imperative code

Anonymous

So k <- m+n means "let k be m+n in this scope"

Anonymous

Of course, it's possible to write that in a tacit way, but it's usually harder to read and understand

Erik the Outgolfer

wow, a rule was clarified here, and, while we all thought it wasn't unclear enough to close (a different meaning was understood), only one solution survived...

Manish Kundu

That was unexpected.. Lmao

Erik the Outgolfer

yeah, it's not recommended to change the rules after answers have been posted

dzaima

16:50

@ManishKundu shouldn't Ignore case-sensitivity be Ignore case? IMO the two are opposites.

Manish Kundu

I am not sure how though

Erik the Outgolfer

they're not really opposites, but the latter is much clearer

dzaima

@EriktheOutgolfer oh, yeah..

Manish Kundu

Looks like this challenge made people April Fool on March :/

Erik the Outgolfer

I think Manish actually means that the input is case-insensitive

Manish Kundu

16:57

Yes

Well that's what I originally wrote though.

Erik the Outgolfer

well, "Ignore case-sensitivity" makes it a tad unclear

Manish Kundu

That was what I wrote alongside too

Be case insensitive wasn't okay?

Wait btw isn't HyperNeutrino 's solution still valid?

Erik the Outgolfer

try changing The Departed (2006) to the Departed (2006)

@ManishKundu well, since "Ignore case-sensitivity" is a tad unclear but clearly refers to the case of the input strings, but yet there is "be case-insensitive" too (second revision), there are two things which refer to the case of the input strings and have different meanings, one can't be sure as to which one they should follow

Manish Kundu

Oh. I get it.

Erik the Outgolfer

so yes, maybe you can roll back to the second revision, but remove "Ignore case-sensitivity"

or even remove that and say that "the strings should be treated as case-insensitive" to be even more clear

I recommend sandboxing challenges, especially if English isn't your natural language, to sort things like this out before posting on main

Manish Kundu

17:07

It was already on sandbox for 2 days

Erik the Outgolfer

yeah, the (new) minimum recommendation is 72 hours, i.e. 3 days, but you are able to call for feedback here too

it's not always your fault, the Sandbox is kinda inactive

2

New Meta Posts

0

Q: Don't downvote off topic posts into oblivion

Related Occasionally, PPCG gets an off-topic post or two. Usually, these are closed fairly quickly, and the user is informed that this isn't what this site is about. The majority of the time, the user is posting here because they have misunderstood the point of the site, not because they want to...

discussion new-users down-votes

feersum

17:35

@NieDzejkob Whatever, a variable binding.

drham

19:31

0

Q: Brother, May I have some oats?

Inspired by this meme, which was originally inspired by this meme Challenge Given an input of a positive integer between 1 and 4 (inclusive, and can be 0 indexed if noted in answer), output the corresponding phrase exactly as it appears below: 1 - can I have some oats, brother? 2 - Might you ...

code-golf kolmogorov-complexity restricted-source

caird coinheringaahing

Q: Does anyone here have the ability to view deleted posts on IPS?

Anonymous

@cairdcoinheringaahing Not me, but if it's important, you can contact an IPS mod

caird coinheringaahing

@Mego No, it's mainly to check the status of a (now deleted) answer

New Main Posts

0

Q: Brother, May I have some oats?

Inspired by this meme, which was originally inspired by this meme Challenge Given an input of a positive integer between 1 and 4 (inclusive, and can be 0 indexed if noted in answer), output the corresponding phrase exactly as it appears below: 1 - can I have some oats, brother? 2 - Might you ...

code-golf kolmogorov-complexity restricted-source

Mr. Xcoder

@NewMainPosts Should it be closed as a dupe of rickroll?

Soaku

19:42

@Mr.Xcoder (1) It has restricted-source. (2) It has input-dependent output

so not of this

rather of another question

Mr. Xcoder

Ah yeah. Anyway, it should be fairly trivial to find another dupe target

I haven't posted anything since March 6th :/.

Esolanging Fruit

20:07

What's the most starred message on TNB?

quartata

Nov 12 '15 at 22:26, by Doorknob

okay seriously stop abusing stars

network wide, actually

but it was pinned

Anonymous

@quartata At least in public rooms, excluding chat.SO. I have no idea about private rooms (and even if I did, I wouldn't be able to say)

Anonymous

20:30

Though I remember something about a message in a private room on chat.SE having more stars being mentioned one of the times that came up

Dennis

That wasn't a private room.

in PHP on Stack Overflow Chat, Feb 25 '13 at 9:40, by DaveRandom

Star this if you want Uncle @Gordon for moderator

Anonymous

Oh, it was chat.SO

Dennis

(74 stars)

Erik the Outgolfer

that was way less stars than the message above

Anonymous

117 on Doorknob's

Dennis

20:35

Well, we had this discussion a long time ago.

Anonymous

That's fair

flawr

I'm about to post this challenge, any objections? codegolf.meta.stackexchange.com/a/14896/24877

Erik the Outgolfer

not an objection, but I edited a little part, if it's not what you meant then you should clarify

flawr

ok, thanks!

Mr. Xcoder

Seems good to me too

Erik the Outgolfer

20:48

I may also suggest using ∘, ≤, ≥ instead of o, <= and >= (I tried to keep it ASCII-only myself)

flawr

I added that, thanks!

I'm still trying to think of interesting examples=/

Mr. Xcoder

Isn't the maxima solution just polydecomp :/?

flawr

@Mr.Xcoder no, this uses rational polynomials

@Mr.Xcoder consider this example: tio.run/##y02syMxN/P@/…

Mr. Xcoder

Ah I see now. That's why Mathematica's Decompose disagreed with the results...

flawr

the goal here is decomposition into integral polynomials, maybe even mathematica's Decompose might return decompositions with rational coefficients

but anyway, the decomposition is not necessarily unique

I cannot actually find something about that in the docs, did you find anything?

Mr. Xcoder

20:59

> decomposes a polynomial, if possible, into a composition of simpler polynomials.

I guess they aren't necessarily integral

Soaku

@Mego 118* :P

flawr

21:15

@Mr.Xcoder could you test another example in mathematica for me?

Mr. Xcoder

Yes

flawr

This one also produces a result with rational coefficients, I wonder what Mathematica does: tio.run/##y02syMxN/P@/…

Mr. Xcoder

So I should test (x^3 + 3*x)^2 + (x^3 + 3*x) - 5?

flawr

right!

sorry for the confusion

Mr. Xcoder

It gives {-5 + x + x^2, 3*x + x^3}

betseg

21:18

anyone else cant register for google code jam?

Mr. Xcoder

Although I won't compete, let me try to register :P

flawr

@Mr.Xcoder there is actually another decomposition

Mr. Xcoder

[(x^2-21)/6, (2x^3+6x+1)] is one of them :P

flawr

@Mr.Xcoder that is the third:)

Οurous

@flawr I think you're going to see two kinds of answers: those that filter the results of built-in decomposition, and those that impmement it.

Mr. Xcoder

21:21

Definitely :)

flawr

@Οurous what if your built in cannot find an integral solution?

Mr. Xcoder

@betseg I just tried, and I had no problems registering

Οurous

@flawr then your built-in is crap and you need a better standard library.

flawr

well so far all built ins are crap

Οurous

Caveat being if they only return one solution.

If they return a bunch, and none are integral, that's horrible.

flawr

21:24

Just downloaded two papers on decomposotion algorithms to see if I missed something:)

3

Οurous

Dedication.

betseg

@Mr.Xcoder huh, apparently privacy badger doesnt like that site

feersum

A while back there was a C&R question where someone (Sp3000?) posted the obligatory semiprime factoring answer. But then it was unexpectedly cracked, after someone else spent roughly $80 on a compute cluster. Does anyone remember who/what question it was?

NieDzejkob

21:46

@feersum I don't remember that, but there's this

Dennis

@feersum Closed thing I remember is this.

737262825 208413108 3974530688 3445680972 2916831257 works but isn't an arithmetic progression. Factored in 3 hours 20 minutes. 512-bit numbers were apparently doable in 72 hours for $75 on EC2 two years ago, so I think that would have been safe. — Peter Taylor Aug 27 '14 at 22:15

feersum

Nah, it was more recent than that.

xnor

22:05

@feersum i think sp3000 was the one who cracked it, but i don't remember what the c&r was

Dennis

11

A: Hidden Inversions (Robbers' Thread)

Python 2, 225 bytes, orlp p=90930641353124136621573325641513715557077985927835294018496194596645372722158;q=101979812089012306249375934082966806799688507587087308196267706260111970225882#--223444799 lambda n:pow(n,pow(65537,(p*q-2*(p+q))/4,p*q),~p*~q) Guess I got lucky after guessing random pr...