The Nineteenth Byte

@LeakyNun I'll start with small values

why do you need .P?

@LeakyNun Because I want to filter the permutations of SQ that sum up to Q, starting with .PSQQ, and then .PStQ and so on...

And break when I find one

9:23 AM

no, permutations always sum to the same value

@LeakyNun I don't think so

no, you don't want permutations

read the challenge and the example again

I have read them carefully once more.

I still... NVM

May I return the length of the largest list that sums up to N instead?

@Mr.Xcoder I'd say yes until I see your code

Still working

9:31 AM

do you want a small hint?

Yes, if it does not use permutations or recursion

.: <seq/num> <int>        All substrings of A of length B.
.: <seq/num> <float>      All substrings of A of length floor(len(A) * B)
.: <seq/num> <none>       All substrings of A of positive length.

:/

e.: ???

No, definitely not

@LeakyNun Am I on the right Path: sM.:Q?

I have no idea what you mean by the right path

I am very sorry for wasting your time @LeakyNun, unfortunately I have to go now. These kind of tasks aren't my forte :(

9:43 AM

@Mr.Xcoder go in peace

9:57 AM

I'm back

Why doesn't this work FN_.:QN?

It throws unsupported operand type(s) for +: 'int' and 'str'.

because it is supposed to be FNQ

Like this Q.:

?

yes

But how do I reverse Q.: then?

Putting _ will make Q negative

what is Q.:?

pyth is prefix notation...

10:03 AM

I want to get this sequence:

[[0], [1], [2], [3], [4], [0, 1], [1, 2], [2, 3], [3, 4], [0, 1, 2], [1, 2, 3], [2, 3, 4], [0, 1, 2, 3], [1, 2, 3, 4], [0, 1, 2, 3, 4]]

, for an input of 5, I get it with .:Q

yes

And to reverse it I use _, so I get _.:Q. When I loop with FNU_.:Q, I get the error

Why?

@LeakyNun HOORAY! I solved it. Pyth, 16 bytes: K_.:Q;FNKIqsNQNB

Probably can be golfed a lot

but you only used K once...

I think I need to introduce one more control flow to you... f.

If I put it in the loop I get the error above

@Mr.Xcoder you need .:Q) to specify the "none" argument

@Mr.Xcoder FN is equivalent to V

10:10 AM

Ah, I see

@LeakyNun FNU is equivalent to V

Pyth, 14 bytes: FN_.:Q)IqsNQNB

@Mr.Xcoder oh, sorry, I don't really use F

except in folding

@LeakyNun But this works: V_.:Q)IqsNQNB

13 bytes, final: V_.:Q)IqsNQNB

How did you solve it?

3 mins ago, by Leaky Nun

I think I need to introduce one more control flow to you... f.

@LeakyNun Do you have a shorter one with f?

@Mr.Xcoder it would be shorter with f but I didn't write the code

10:13 AM

@LeakyNun With f as in First input where A(_) is truthy over [B, B+1, B+2, ...]?

Q: I'm working on a PPCG remake outside of SE

@Mr.Xcoder no

8 bytes @Mr.Xcoder

New Meta Posts

0

As the title says, I'm working on a PPCG remake outside of SE. https://github.com/PPCGRemake/PPCGRemake This is currently in the planning stage. I'm planning to build this with Ruby on Rails. If anyone wants to help with this project or otherwise support it, please comment or add a GH issue, I'...

I would have done it that way if I new how to use f :P

I was literally staring at <l:T>

just ask next time

:)

miles

10:36 AM

@LeakyNun bit late but 1{[:,[:+/ .*/I.@|.@#:_&(]+/ .*~)_2]\#:@7: for log2(n) Fibonacci numbers using the Fibonacci matrix [[1,1],[1,0]] and exponentiation by squaring

@miles nice...

Optimizer

11:16 AM

@Dennis Congrats for the hacker news post

dzaima

11:39 AM

why the hell does SOGLs source code get random appendings of //<>//..

12:49 PM

@JonathanAllan what do you mean by AL€œs3?

would it be the same as A1ẋœs3 or 1ṁœs3?

I assume the former but not completely sure...

@NewMetaPosts are they trying to get downvotes?!

huh? that's off-topic nothing to do with ppcg at all

@EriktheOutgolfer Exactly. I'Ve already casted my VTC

me too

@EriktheOutgolfer what is this?

12:56 PM

Yeah I started with the idea of using AL€œs3 and found div by zero errors and then after I addressed that with the much longer code above found I still needed to special case the equal length case. I thought I'd try and implement a different way today, but looks like you did already. — Jonathan Allan 14 mins ago

(where I outgolfed him)

I decided to continue discussion here

codegolf.stackexchange.com/a/132678/48934

outgolfing the existing answer in one strike

@LeakyNun Why did you delete it? For someone that does not know Jelly, that seems very different.

@Mr.Xcoder the algorithm used is the same

maybe you should do it in Pyth

I'll help you golf your solution

@LeakyNun If you also help me design it, I am happy to solve it :)

@Mr.Xcoder does that mean giving you the algorithm?

1:08 PM

No, of course not

then what do you mean?

If I ask for tips, you give me tips :P

alright

(If you can and want, of course)

I should port the Python answer, it seems easier than writing it using a different approach

How does sorted(sum(j,[])) work in the Python solution?

sum(j,[]) flattens the list

1:15 PM

@LeakyNun Like .n in Pyth?

@Mr.Xcoder like s.

reduce on +, base case []. (Pyth +)?

Q: What should we do about post that are copied from external sources?

yes

New Meta Posts

0

A recent challenge has been posted on the main site. A user discovered that it was copied word-to-word from an external source, and that challenge has been closed as off-topic, with this reason: "Questions without an objective primary winning criterion are off-topic, as they make it impossible to...

discussion close-reasons

@DestructibleLemon you still can do that with the formula I gave you

after finding $t$, you can easily get the coordinates

1:25 PM

@LeakyNun I'm afraid I am not yet ready to solve such a hard challenge.

I have sth like this: KYFKr2heQFN.CQfq0%NK aKSsNY;K, but It errors and can't debug it

the coordinates of circle 1 are (x1+t*v1x,y+t*v1y)

for circle 2, you change the 1s to 2s

note that v is velocity

@Mr.Xcoder you can seldom see F in my code, for a reason.

@LeakyNun What do you mean?

@Mr.Xcoder for there are shorter alternatives such as m, f, u, etc.

Ah, that's the reason you don't use F.

I am trying to translate this piece of code:

[q for q in range(a[-1])if a in[sorted(sum(j,[]))for j in combinations([[p for p in a if p%i<1]for i in range(2,1+a[-1])],q)]]

1:29 PM

@DestructibleLemon so once you get the time of collision and the x,y coordinates, you can create an equation for both circles. Then you find the point of intersection of both circle equations

and that will tell you the coordinate of contact on the circle

wait, I'll come up with something

It's a bit too clumsy for a beginner like me, I need something easier such that I learn slowly.

projecteuler.net/thread=31&page=9#281730

My R solution to PE#31

much faster than the one I posted above

this one uses dynamic programming and discrete convolution

@LeakyNun You gave me a source of inspiration: I'll try to solve PE problems in Pyth :))

@Mr.Xcoder nice. I'll be here to help you (golf your solutions)

Thanks... I'm so (over)excited right now

1:38 PM

ooh ooh would i be able to query wolfram alpha with the formulae from oeis

I've already solved that in Python in the past (PE #1), and I can't submit another one: if the correct result is 233168, I have got an extremely ungolfy solution: sf|q0%T3q0%T5S999

Got the same result with a horribly ungolfy code: V^T3I|q0%N3q0%N5=+ZN;Z

@LeakyNun Why doesn't this sf>2+%T3%T5S999 give correct results?

@Mr.Xcoder because 0+3 > 2

Oh god, you're right

@LeakyNun That being said, can this be golfed furter: sf|q0%T3q0%T5S999?

change the q0 to !

and then use demorgan laws

demorgan?

1:52 PM

De Morgan's laws

In propositional logic and boolean algebra, De Morgan's laws are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation. The rules can be expressed in English as: the negation of a conjunction is the disjunction of the negations; and the negation of a disjunction is the conjunction of the negations; or the complement of the union of two sets is the same as the intersection of their complements...

A: Sandbox for Proposed Challenges

I currently have this: sf|!%T3!%T5S999

New Sandboxed Posts

0

Title: Chicken McNugget Numbers Description Chicken McNugget numbers are numbers that can be expressed as a sum of 6, 9 or 20 - the initial sizes of the famous Chicken McNuggets boxes sold by McDonalds. In that sum, a number may occur more than once, so 6 + 6 = 12 is such a number too. The firs...

2:15 PM

codegolf.stackexchange.com/a/82315/68615

@totallyhuman Pfffffff

@Mr.Xcoder then?

@LeakyNun I didn't golf it further, I'm too lazy right now.

https://esolangs.org/wiki/*

@LeakyNun I've been looking at your Pyth answer, because I wanted to see if my new explanation for my answer is good enough, and scrolled down and found your Pyth sumbission, which is surprisingly golfy.

2:19 PM

best language ever

That's a hyper-esolang

I think PPCG has never been that sleepy :/

Literally nothing happens

3:28 PM

the worst word that has ever existed: pricing

maybe worse? "taxes" idk

no pricing is the word that when you see it you realize you have to go away

and it's often used for an awesome online service

True. :P Most services, etc. I look at it am I'm like "cool I should get this" until I see "Pricing: " and then I leave :P

google.com#q=pricing

> may be part of the business's marketing plan.

only may be?

3:41 PM

Yeah, I'm disappointed Github :(

Nathan Merrill

@Mr.Xcoder why would you expect that a large company hosting billions of lines of code wouldn't offer a paid plan?

yeah you can't make private repositories essentially

Companies need to make money some way

Q: Is it possible to estimate the speed of a passing vehicle using a musical ear and the doppler effect?

@EriktheOutgolfer That's not a bad thing though.

Nathan Merrill

10

I've found a number of questions that concern the Doppler effect, but none that seem to address my question. I have a background in music. People with a musical ear can generally tell the ratio between two frequencies (as a musical interval). For anyone who's not already aware, we perceive a rat...

waves acoustics velocity frequency doppler-effect

3:50 PM

huh, should try that once

oeis.org/A000017

um wat

an erroneous version :I why do they have that

also I should maybe continue my python oeis package sometime :c

oeis.org/A000012 lol

I wonder how many of these they have

@EriktheOutgolfer in bitbucket you can have private repos

and it uses git

> Number of ways of writing n as a product of primes.

>< why

@EriktheOutgolfer Only just noticed these messages, sorry! Equivalent to A1ẋœs3 yeah. Splitting a run of 1s into three chunks of equal lengths, but if the input to split into 3 were [1,1] you end up with [[1],[1],[]] not [[1],[1]] as I was expecting and other things to work around. Meanwhile I've golfed the existing answer all the way down to 34 to nip at your heels :p

4:01 PM

mine is 33

@HyperNeutrino 21

@totallyhuman What a precision

i remember trying to look for the all 42's sequence

does it exist?

> There's probably a much shorter way though!

4:04 PM

yes 34 is nipping at the heels of 33, and you are nipping at the heels of Emigna :)

heh that's entirely different stuff

hmm, maybe I should cross out much

@LeakyNun you might be interested in chat.stackexchange.com/rooms/61917/3n1-2

ascii-only and I are discussing optimisations for that problem

oeis.org/A010871

32 whoops

New Main Posts

-1

Q: Who did commit at most?

Background Sometimes, people think you didn't work at your git project. But - you can prove yourself with git shortlog -n. Now, the problem is you are a programmer and programmers are lazy. So you want to write a program which shows the person who committed at most. Rules You may not do the fo...

code-golf string git

4:06 PM

but that's the max

oeis.org/wiki/Constant_sequences

@JonathanAllan forgot to update tio link or something?

oeis.org/A010701

@Cowsquack ok

If it only contains 3s, why isn't it called A333333?

@EriktheOutgolfer oops seems so, thanks.

4:15 PM

btw that's ạðḤ‘:3ṭạ¥⁸1ẋ+;€⁹¦3Ṛ‘ṭ;5ị“Aoah!B”ð> as a 1-liner

yep

too bad the best I can get to compressing “Aoah!B” is “£ʂɱYṠṬ`» :(

Best OEIS sequence

technically stole this idea from someone else :P but it's interesting i think

thoughts on this string representation?
A000004: The zero sequence.
Monday, 16-May-1994 07:00:00 GMT
Keywords: [core] [easy] [nonn] [mult]
Author: N. J. A. Sloane

How about Date of Creation: [line 3]

that way every line is [A-Za-z0-9 ]+: .+$ :P

4:26 PM

how's Cthulhu doing @Mr.Xcoder

:P

@CensoredUsername I've just started writing it again. I deleted it a couple of days ago because of a rage, and now I've started creating it once more

heh

> because of a rage

>.<

You know first try

4:27 PM

Is cthulhu a new language?

lol true

I rewrote Paintbrush after all after it failed :P

@cairdcoinheringaahing A language I'm planning to create

I've now like 3 times rewritten the start of Eldritch

language creation is hard

Very

I've made 3 languages in about a month and all of them are bad :c

4:28 PM

@HyperNeutrino At least you've made one.

I am planning to make it stack based this time

lol

I wonder if there are any languages with tree-based memory

if not I want to do that :P

Who needs 3 languages, when you can have 12?

current goals are basically "easy vectorization, like jelly. Complete absence of variables, but not reliant on arity, and not stack based. Syntax similar to zalgo text, with the ascii parts resembling stuff from the mythos"

help me clean up this ugly code:
keywords = ' '.join('[{:s}]'.format(key) for key in self.info['keywords'])
return 'A{0:06d}: {1:s}\n{2:s}\nKeywords: {3:s}\nAuthor: {4:s}'.format(
    self.seq_id, self.name, self.info['created'], keywords, self.info['author'])

Also make it look like some insane Greek philosopher trying to communicate [finding source]

4:30 PM

@CensoredUsername You create it and we'll see.

2 days ago, by Conor O'Brien

Typical vote distribution on answers (with definitely no basis on reality):

+100: the "themed"/"joke" answer, or, less often, the one answer to a hard qeuestion.
+33: the generally impressive answer, which took lots of time to produce, often aided with proof.
+8 to +100: the cool-looking pile of code that vaguely resembles an insane Greek philosopher trying to communicate: `ßæ×ɲ«Hµɱs`.
+4: the generic programming language answer.
+1 to +2: the generic esolang language answer.
+7 to +13: the fashionable new esolang answer.

I'm working on it right now

pls it's very ugly

It's extremely hard to make it non-stack and non-link based

basic ideas / flow control is nailed out, now writing an actual test implementation

4:30 PM

and non-arity

I've solved that one already

I have temporal addressing

:)

I am doing it stack based

combined with arity stuff

This is the interpreter for my latest language. Its designed for polyglots

DJMcMayhem

Woah

@DJMcMayhem what woah?

DJMcMayhem

4:31 PM

I just received my 100th silver badge! \o/

Jelly has ~2500 lines and you have ~1250 bytes :P

but the goal of my language is also that it should be usable for more complex challenges, i.e. stuff where you never see jelly, pyth and stuff

@DJMcMayhem congrats!

@CensoredUsername You can theoretically solve anything in Jelly and Pyth. They are Turing-complete.

beware of the turing tarpit, where anything is possible yet nothing is easy

4:33 PM

keywords = ' '.join(map(lambda key: '[{:s}]'.format(key), self.info['keywords']))
return '''
A%s: %s
%s
Keywords: %s
Author: %s
''' % (str(self.seq_id).zfill(6), self.name, self.info['created'], keywords, self.info['author'])[1:-1]

Jelly can eval Python code, so it's pretty easy. :P

I don't know if it makes it any better :P

@Dennis that's cheating :c

@Mr.Xcoder yeah but no-one is going to spend years trying to solve this is Jelly

:P anyway gtg now, o/

@Dennis yes but it's shorter to then just post the python code as answer :)

4:34 PM

> in Conway's Game of Life

@HyperNeutrino code the program in Jelly that solves it in GoL

unless that works with the dictionary-compressed string stuff

@CensoredUsername Not if you manage to compress it. Python code is usually highly compressible.

I'm aware, I've written a few python minifiers/compressors in my life

I have a module somewhere that compresses python pickle files by just embedding the file zipped, and abuses the pickling machinery to just decompress and then unpickle it

This is Cthulhu right now: stack = []

4:37 PM

oh nice

PhiNotPi

You can't see the rest of the code because it's in another dimension.

I just looked at Helka Homba's profile and saw that he has 13 great question badges (100+ upvotes on a question)

@PhiNotPi Precisely.

Tha's more rep than I'm ever going to get :(

fun fact: you can pack all ascii / combining diacretics in one 256 entry codepage

4:39 PM

@cairdcoinheringaahing That's technically more than 100*13*5 = 6500. If HelkaHomba lost ~2500 because of repcap, I'm close

there are no finite sequences on oeis right?

hey gamers

@ckjbgames ...wrong room?

@totallyhuman Sure there are.

o.o

4:41 PM

oeis.org/A104101

@totallyhuman https://oeis.org/search?q=keyword%3Afini&language=english&go=Search

A: Sandbox for Proposed Challenges

@totallyhuman no i'm just greeting you guys

:)

0

The Chroma Key to Success code-golfgraphical-outputimage-processing The RGB color value #00FF00 is a rather important one: it is used to make movies, TV shows, weather announcements, and more. It is the famous "TV green" or "green screen" color. The Challenge Your task is to write a program ...

Latest challenge submission

Tell me what you think

@totallyhuman: even if there weren't explicitly finite sequences there, you'd still be quite hard-pressed to prove that some of them are infinite

@CensoredUsername context

@totallyhuman Fermat Primes

dzaima

4:42 PM

@totallyhuman every sequence with the [fini] keyword

ok wow

55 secs ago, by Leaky Nun

@totallyhuman https://oeis.org/search?q=keyword%3Afini&language=english&go=Search