only new thing: `background: green;`

you're not very observing, are you? ;)

1

Definition Two integers are coprime if they share no positive common divisors other than 1. Example a(11) = 6 because 6 is coprime with the last two predecessors (namely, 11 and 13) and 6 has not appeared before. Notes Note that the sequence is not ascending, meaning that an element can...

^
why?

should I delete my answer if dennis halved its size using the same language

4:02 PM

okay

only got 5 views so ill repos :P:

@Downgoat you deleted a language about carrots and goats?

Nov 25 '15 at 5:29, by ןnɟuɐɯɹɐןoɯ

4:15 PM
wat

Woo Nichijou

OH NO
ITS A SUPERPOSITION GOAT

OMG

4:18 PM
wat
@logic where are you plz

@LeakyNun how long did it take to calculate 100000 for your challenge?

@orlp I just copied it from OEIS

my current answer in C is slow...

@LeakyNun Why would `while(c in r)-~gcd(c,r[-2]*r[-1]):` work?

@Sherlock9 `or` is just `+` when both numbers are non-negative
and then `gcd(c,r[-2]*r[-1])>1` becomes `gcd(...)-1`

4:30 PM
But at what point is that expression zero?

@Sherlock9 wait, it should be `+~-` right
@Sherlock9 when c is not in r and the gcd is 1

Yeah, that works

for readability purpose you would just want to write `+gcd(...)-1`

4:44 PM

@orlp I love smbc so much

@Adnan Any reason 2sable isn't on Tio! yet?

No, not really :p
Can you add it to TIO?

4:50 PM
Aye

How different are they?

2sable is used more for ASCII challenges
To beat V :p

I've noticed.
Lol :)

I didn't succeed last time though haha

n+ = n²+n ಠ_ಠ

4:53 PM
@Adnan How do I enable safe mode?

@DJMcMayhem heyyy I had an idea that I'm too lazy to implement in a string golfing language. does V have it's own room?

Nevermind.

:P

@ConorO'Brien yeah, it does! It could use some activity too

### Vim-golf

@Adnan 2sable.tryitonline.net/… Can't figure out how to input newlines though.

4:56 PM
Damn, I'll fix that in a minute.

TIL there is a link to the homepage of the language on TIO

@Adnan why an osabie and 2sabie but no 1sabie?

@Downgoat Because 2sable is the second version of 0sable. Just like there's no One Fast, One Furious.
5

so the v1 is unrealeased

5:05 PM
So first osabie should be just sabie or 1sabie

In caps: 2SABLE
Not SABIE

.__.
oh :|
@Downgoat @mod pls eleven in fix? :3
2 hours ago, by Sherlock9
It would help if we could stop being funny for a second, but unfortunately all PPCG people are intelligent, funny, and good-looking so we're screwed :D
> all PPCG people
> people
;_; y no gaots, penguins, bird, doges, dragons, robots, door opening devices, rubiks cubes, AIs, and other animals

People ≠ humans, IMO.

> peo·ple
ˈpēpəl/Submit
noun
1.
human beings in general or considered collectively.
> human
@TùxCräftîñg fixed
oh i forgot turtles. sorry trichoplax

To me, it feels like a “person” is anything with, well, a “personality.” So, I dunno, AIs or anthropomorphic animals or robots, in a work of fiction, could be people

5:13 PM
fixed what?

2 mins ago, by Downgoat
;_; y no gaots, penguins, bird, doges, dragons, robots, door opening devices, rubiks cubes, AIs, and other animals

@Doorknob I’m writing a Snowman interpreter :3

i gtg bai. will finish cheddar next year

@Downgoat NOOOOOOOOOOOOOOOOOO

5:16 PM
.o/

5:37 PM
@Downgoat 2sable sounds better than 1sable
imo

ArtOfCode have 666 rep ö

@DJMcMayhem More like one site where we have Tetris-in-GoL type questions and another where alphabet challenges are posted.

Oh man, that would be so cool if there was a site for tetris-in-GOL questions

@Sherlock9 should i just remove all of the comments?

5:46 PM
Just the ones that have been summed up later
And maybe the while since that's erroneous, but that's up to you

I deleted everything

Oh, ok
Thanks

guys can you help me on a complexity analysis
it's similarish to knapsack, but I don't believe it's NP-complete
I have a list of n positive integers each < 20
find the maximal amount of subsets such that each subset has a sum >= 40

not sure what you mean -- do you want the number of such subsets?

I want to find a list of subsets that is the largest possible (in number of subsets)
e.g. if I give you [19, 2, 19, 10, 15, 15] the optimal answer is [[19,19,2],[10,15,15]]

5:57 PM
@orlp linear time

@LeakyNun why?

oh, so you want to partition the numbers into disjoint subsets with sums at least 20, and want the partition to include as many subsets as possible

@xnor correct

eh, may be n*log(n) time

Heh. 666 rep.

5:59 PM
But they can be rearranged

can't you just take the maximum

@LeakyNun no

@orlp why not?

that would result in `[[19, 19, 15]]`

@ArtOfCode Hehe, I was noticing that earlier

leaving not enough for a second partition
@xnor clarification, you don't have to use up all elements

without the <20 bound, it's at least as hard as subset sum
which is NP-complete

@orlp oh, i was wrong

I think the <20 is critical though

@mınxomaτ wat

6:00 PM
might allow some dynamic programming or branch/bound
@xnor why is it as hard as subset sum though?

@orlp I was thinking about <= 40

I said positive numbers
you don't exactly have to hit n = 40
for example

@orlp you have some numbers with sum 2*K and ask to partition them into two containers of size K
this is possible exactly if some subset sums to K

Interesting question. It's definitely at least n*log(n) but I'd guess it's n^2. I'm not sure what's optimal though

@El'endiaStarman you have a raw text of TNB right?

6:03 PM
@xnor is that problem hard even with just positive numbers?
either way

that problem is easy with DP if the sum is bounded

`Am I the only one tired of being linked to source forge`

forge

fixed

6:06 PM
@RohanJhunjhunwala sourceforge.net

no
lol
Source forge seems like such a shady sight
Anyone agree?

@RohanJhunjhunwala sourceforge.net

@orlp i think this paper is about your problem, though I can't access it: researchgate.net/publication/…

6:12 PM
oh no
Wow I inspect elemented it
another link to source forge nice try :D

@orlp i think this gives a polytime solution: arxiv.org/pdf/1307.5108.pdf

hahahaha :P

I will never clink on links in the TNB ever again. I will always inspect element it first to ensure that I do not get rick rolled after that troll Adnan :(

le secret

6:14 PM
@xnor I'm confused
I'm doing 1 dimensional bin packing, no?

@orlp yes, the paper mentions it's also called stock cutting

also, I want each set to AT LEAST have sum >=
not sum <= BIN_MAX

oh, right

you can link using markdown here

you'd have to negate everything, don't know if the problem allows for that

6:15 PM
I just am not too sure how

Oh, duh. I get it now

@xnor how would negating work

-1 < max, -1 + -3 < max, any sum of negative numbers < max

6:16 PM
@orlp can you make max be negative too?

@xnor I really doubt any algorithm will work then

@Downgoat No problem :) I'm not actually a turtle (and even my avatar isn't a real turtle...).

adding more items would suddenly make options viable
whereas with bin packing it's the exact opposite

hmm

I just don't see an efficient algorithm for bin packing be prepared for that
that doesn't make any sense
on top of that, bin packing tries to minimize the number of bins, no?
we try to maximize the number of 'adequately filled' bins

6:25 PM
Question: In NMS, can you successfully evade pirates by entering a planetary atmosphere?
Yeah, currently flying over a planet, trying to get some thamium-9 from asteroids but get attacked immediately after leaving the planet

thaumium i think

It should be, yeah, but it's spelled wrong

@flawr so cool seeing him in the videos, and then the channel thumbnail
he's like 50 now

6:40 PM
^ new rickroll

...
o_O

ಠ_ಠ

@zyabin101 i literally just rickrolled a friend with that
before you said that

@ArtOfCode Where do you think the OEIS entry contradicts itself?

@Dennis but is there a 0 Fast, 0 Furious?

6:45 PM
so... maximizing the number of bins...

Cars is a 2006 American computer-animated comedy-adventure produced by Pixar Animation Studios and released by Walt Disney Pictures. Directed and co-written by John Lasseter, it is Pixar's final independently-produced motion picture before its purchase by Disney. Set in a world populated entirely by anthropomorphic cars and other vehicles, it features the voices of Owen Wilson, Paul Newman (in his final non-documentary feature), Larry the Cable Guy, Bonnie Hunt, Tony Shalhoub, Cheech Marin, Michael Wallis, George Carlin, Paul Dooley, Jenifer Lewis, Guido Quaroni, Michael Keaton, Katherine Helmond...

10/10

@xnor It says that only rows should increase, but then it says a(3)=2, which is not true if columns don't have to increase too
so it's a case of ignore most of it, use the formula to calculate

@ArtOfCode where does it say only rows should increase?

@Downgoat and Unipants :3

6:49 PM
@xnor hang on, I'm reading two similar sections that say different things.

@ConorO'Brien Not exactly - it was parsed into a database.

Okay @xnor, fixed the spec. Shall we clean up comments?

@El'endiaStarman oh.

@ArtOfCode sure

@ConorO'Brien I shared a Gist with quartata that had the script I used to parse the database. Perhaps you could use it for your purposes.

6:56 PM
Planes is a 2013 American 3D computer-animated sports comedy film produced by DisneyToon Studios and released by Walt Disney Pictures. It is a spin-off of Pixar's Cars franchise and the first film in a planned Planes trilogy. Despite not being produced by Pixar, the film was co-written and executive produced by Pixar and Walt Disney Animation Studios' chief creative officer John Lasseter, who directed the Cars films. The film stars the voices of Dane Cook, Stacy Keach, Priyanka Chopra, Brad Garrett, Teri Hatcher, Danny Mann, Julia Louis-Dreyfus, Roger Craig Smith, John Cleese, Carlos Alazraqui...

Submarine is a 2010 coming-of-age comedy-drama film adapted from the 2008 novel of the same name by Joe Dunthorne. The film was written and directed by Richard Ayoade, and starred Craig Roberts, Yasmin Paige, Noah Taylor, Paddy Considine, and Sally Hawkins. Submarine is Ayoade's directorial debut. == Plot == Oliver Tate (played by Craig Roberts) is a 15-year-old from Swansea, infatuated with Jordana (Yasmin Paige). When Jordana invites Oliver to meet secretly after school, she takes pictures of them kissing, hoping to make her ex-boyfriend jealous. The plan backfires, but Jordana soon becomes his...

why are we wiki-linking random films?

@El'endiaStarman thanks, but I'd only need the raw stuff. ^_^