The Nineteenth Byte

Conor O'Brien

4:00 PM

I slightly modified my blog's css--thoughts?

TùxCräftîñg

only new thing: background: green;

Conor O'Brien

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

Leaky Nun

1

Q: Smallest positive integer which is coprime to the last two predecessors and has not yet appeared; a(1)=1, a(2)=2

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...

2 salt votes..

Conor O'Brien

^

why?

Zwei

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

Leaky Nun

4:02 PM

@Zwei Nope. You shall glorify him by keeping your answer.

Zwei

okay

Conor O'Brien

usquidditch.org

Downgoat

only got 5 views so ill repos :P:

11 hours ago, by Downgoat

Bloggoat: Resolving Git Accidents 101

TùxCräftîñg

github.com/RikerW/Goatspin

@Downgoat you deleted a language about carrots and goats?

Downgoat

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

TùxCräftîñg

4:15 PM

wat

Downgoat

^

Sp3000

Woo Nichijou

orlp

OH NO

ITS A SUPERPOSITION GOAT

RUN FOR YOUR LIVES

TùxCräftîñg

OMG

Downgoat

TùxCräftîñg

4:18 PM

wat

@logic where are you plz

orlp

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

Leaky Nun

@orlp I just copied it from OEIS

orlp

my current answer in C is slow...

Sherlock9

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

Leaky Nun

@Sherlock9 or is just + when both numbers are non-negative

and then gcd(c,r[-2]*r[-1])>1 becomes gcd(...)-1

Sherlock9

4:30 PM

But at what point is that expression zero?

Leaky Nun

@Sherlock9 wait, it should be +~- right

@Sherlock9 when c is not in r and the gcd is 1

Sherlock9

Yeah, that works

Leaky Nun

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

orlp

4:44 PM

Rohan Jhunjhunwala

smbc

DJMcMayhem

@orlp I love smbc so much

Dennis

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

Adnan

No, not really :p

Can you add it to TIO?

TùxCräftîñg

the name of your languages start with a number

Adnan

4:50 PM

Aye

DJMcMayhem

How different are they?

Adnan

2sable is used more for ASCII challenges

To beat V :p

DJMcMayhem

I've noticed.

Lol :)

Adnan

I didn't succeed last time though haha

TùxCräftîñg

n+ = n²+n ಠ_ಠ

Dennis

4:53 PM

@Adnan How do I enable safe mode?

Conor O'Brien

@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?

Dennis

Nevermind.

Adnan

:P

DJMcMayhem

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

Vim-golf

Discussion about golfing in Vim/V. vim.org/download.php github...

Dennis

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

Adnan

4:56 PM

Damn, I'll fix that in a minute.

TùxCräftîñg

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

Downgoat

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

TùxCräftîñg

^

Dennis

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

5

TùxCräftîñg

so the v1 is unrealeased

Downgoat

5:05 PM

So first osabie should be just sabie or 1sabie

Sherlock9

In caps: 2SABLE

Not SABIE

Downgoat

.__.

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

Lynn

People ≠ humans, IMO.

Downgoat

> 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

Lynn

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

TùxCräftîñg

5:13 PM

fixed what?

Downgoat

2 mins ago, by Downgoat

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

TùxCräftîñg

ah

Lynn

@Doorknob I’m writing a Snowman interpreter :3

Downgoat

i gtg bai. will finish cheddar next year

Conor O'Brien

@Downgoat NOOOOOOOOOOOOOOOOOO

TùxCräftîñg

5:16 PM

.o/

Adnan

5:37 PM

@Downgoat 2sable sounds better than 1sable

imo

TùxCräftîñg

ArtOfCode have 666 rep ö

El'endia Starman

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

DJMcMayhem

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

Sherlock9

@LeakyNun Could you please remove some of your comments on my answer that have been superseded by later comments?

Leaky Nun

@Sherlock9 should i just remove all of the comments?

Sherlock9

5:46 PM

Just the ones that have been summed up later

Everything before codegolf.stackexchange.com/questions/89812/…

And maybe the while since that's erroneous, but that's up to you

Leaky Nun

I deleted everything

Sherlock9

Oh, ok

Thanks

orlp

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

xnor

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

orlp

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]]

Leaky Nun

5:57 PM

@orlp linear time

orlp

@LeakyNun why?

xnor

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

orlp

@xnor correct

Leaky Nun

eh, may be n*log(n) time

ArtOfCode

Heh. 666 rep.

DJMcMayhem

5:59 PM

But they can be rearranged

Leaky Nun

can't you just take the maximum

orlp

@LeakyNun no

Leaky Nun

@orlp why not?

orlp

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

DJMcMayhem

@ArtOfCode Hehe, I was noticing that earlier

mınxomaτ

5:59 PM

Clearly the best thing ever invented

orlp

leaving not enough for a second partition

@xnor clarification, you don't have to use up all elements

xnor

without the <20 bound, it's at least as hard as subset sum

which is NP-complete

Leaky Nun

@orlp oh, i was wrong

orlp

I think the <20 is critical though

TùxCräftîñg

@mınxomaτ wat

orlp

6:00 PM

might allow some dynamic programming or branch/bound

@xnor why is it as hard as subset sum though?

Leaky Nun

@orlp I was thinking about <= 40

orlp

I said positive numbers

you don't exactly have to hit n = 40

for example

xnor

@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

DJMcMayhem

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

Conor O'Brien

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

orlp

6:03 PM

@xnor is that problem hard even with just positive numbers?

either way

xnor

@orlp yes, en.wikipedia.org/wiki/Partition_problem

orlp

that problem is easy with DP if the sum is bounded

Rohan Jhunjhunwala

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

Conor O'Brien

forge

Rohan Jhunjhunwala

fixed

Leaky Nun

6:06 PM

@RohanJhunjhunwala sourceforge.net

Rohan Jhunjhunwala

no

lol

Source forge seems like such a shady sight

Anyone agree?

Leaky Nun

@RohanJhunjhunwala sourceforge.net

Rohan Jhunjhunwala

why?

xnor

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

Adnan

@RohanJhunjhunwala how about https://www.youtube.com/watch?v=dQw4w9WgXcQ

Rohan Jhunjhunwala

6:12 PM

rick roll Adnan? I am not clicking that link lol

oh no

Wow I inspect elemented it

another link to source forge nice try :D

xnor

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

Adnan

hahahaha :P

Rohan Jhunjhunwala

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 :(

DJMcMayhem

@Adnan O_o how?

Adnan

le secret

orlp

6:14 PM

@xnor I'm confused

I'm doing 1 dimensional bin packing, no?

xnor

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

orlp

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

not sum <= BIN_MAX

xnor

oh, right

Rohan Jhunjhunwala

you can link using markdown here

xnor

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

Rohan Jhunjhunwala

6:15 PM

I just am not too sure how

DJMcMayhem

Oh, duh. I get it now

orlp

@xnor how would negating work

flawr

Rick Astley - Hold Me In Your Arms

►

orlp

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

Rohan Jhunjhunwala

why?

xnor

6:16 PM

@orlp can you make max be negative too?

orlp

@xnor I really doubt any algorithm will work then

trichoplax

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

orlp

adding more items would suddenly make options viable

whereas with bin packing it's the exact opposite

xnor

hmm

orlp

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

TùxCräftîñg

thaumium i think

ArtOfCode

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

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@flawr so cool seeing him in the videos, and then the channel thumbnail

he's like 50 now

zyabin101

6:40 PM

New sandboxed challenge :d

^ new rickroll

Eᴀsᴛᴇʀʟʏ Iʀᴋ

...

o_O

get out of my head

TùxCräftîñg

ಠ_ಠ

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@zyabin101 i literally just rickrolled a friend with that

before you said that

xnor

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

Eᴀsᴛᴇʀʟʏ Iʀᴋ

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

orlp

6:45 PM

@xnor cs.stackexchange.com/questions/62591/…

so... maximizing the number of bins...

Dennis

Cars (film)

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...

Eᴀsᴛᴇʀʟʏ Iʀᴋ

10/10

ArtOfCode

@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

xnor

@ArtOfCode where does it say only rows should increase?

zyabin101

@Downgoat and Unipants :3

ArtOfCode

6:49 PM

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

El'endia Starman

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

ArtOfCode

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

Conor O'Brien

@El'endiaStarman oh.

xnor

@ArtOfCode sure

El'endia Starman

@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.

flawr

6:56 PM

Planes (film)

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...

Helka Homba

Submarine (2010 film)

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...

ArtOfCode

why are we wiki-linking random films?

Conor O'Brien

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

Vim-golf

Transcript for