The Nineteenth Byte

Quintec

01:32

How to get your question reopened... ping everyone who closed it? thinking

Destructible Lemon

😕💭

Veskah

@Quintec so you're saying that doesn't work? :^)

Shieru Asakoto

01:53

lmao

Quintec

02:05

@Veskah Well, I suppose "all of it" is a valid answer... :P

Veskah

02:18

Pro-strat: When doing ascii art, make sure to reflect any leading white-space as trailing white-space

Some days I'm real dumb. The problem is that it's most days

New Sandboxed Posts

02:34

0

A: Sandbox for Proposed Challenges

The real treasure was the numbers we made along the way code-challenge restricted-source Your task is to write a program, function or snippet (yes, a snippet is allowed), that outputs a number. However, you must be able to separate your submission into prefixes that also produce numbers. You ca...

Pavel

05:01

Is chocolatey not working for anyone else

mınxomaτ

06:45

> Repository 'http://dl.google.com/linux/chrome/deb stable Release' changed its 'Origin' value from 'Google, Inc.' to 'Google LLC'

Did Google change it's legal framework? Interesting...

quartata

>LLC

wuh

apparently it was actually a while back as part of the alphabet thing

still funny to think of google as “limited liability”

mınxomaτ

I guess changing the debian package metadata was pretty low on the list of priorities.

New Sandboxed Posts

08:52

0

A: Sandbox for Proposed Challenges

I'm not sure if this is a duplicate. The first, the last, and the rest Given two numbers output the two numbers, and then the range between them: Examples: Input Output 0, 5 -> [0, 5, 1, 2, 3, 4] -3, 8 -> [-3, 8, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7] 4, 4 -> [4, 4] 4, 5 ->

New Sandboxed Posts

09:22

0

A: Sandbox for Proposed Challenges

This is a follow up to Count arrays that make unique sets . The significant difference is the definition of uniqueness. Consider an array A of length n. The array contains only positive integers. For example A = (1,1,2,2). Let us define f(A) as the set of sums of all the non-empty contiguous s...

Anush

09:50

hi all

jaytea

Hi

Anush

13:54

trickier question posed

New Main Posts

0

Q: Count arrays that make trickier unique sets

This is a follow up to Count arrays that make unique sets . The significant difference is the definition of uniqueness. Consider an array A of length n. The array contains only positive integers. For example A = (1,1,2,2). Let us define f(A) as the set of sums of all the non-empty contiguous s...

Adám

@NewMainPosts Nice timing!

Anush

thanks, says the machine :)

please do let me know if it is unclear

Adám

14:25

@dzaima Dark SE cuts off the bottom part of many names

Anush

15:17

question deleted

I need help checking the examples

@user202729 Do you have a version of codegolf.stackexchange.com/a/174302/9207 that outputs all the possible solutions? I am trying to use it to see if there is only one but it sometimes reports an array and its reverse and sometimes doesn't

so it's hard to tell when the answer is unique

user202729

@Anush Change the - between or and print to a space.

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

This is a follow up to Count arrays that make unique sets . The significant difference is the definition of uniqueness. Consider an array A of length n. The array contains only positive integers. For example A = (1,1,2,2). Let us define f(A) as the set of sums of all the non-empty contiguous s...

Skidsdev

15:39

howdy folks

Anush

15:59

@user202729 Hmm.. I did that and even ungolfed it a little but I must have done something wrong. would you be able to check one of the cases for codegolf.meta.stackexchange.com/questions/2140/… please?

if you could just check s = 2 and n = 6 that would be very helpful

user202729

What's wrong?

Anush

@user202729 my version of your code does something screwy

e.g. for the array 3, 3, 2, 2, 3, 2 it gives two equivalent arrays (3, 2, 2, 2, 4, 2), (3, 3, 2, 2, 3, 2)

but why not the reverse?

user202729

For each A/reverse(A) pair, it may output one of them or both.

...

So actually it does not output all solutions, but it's sufficient to check if an array is unique.

New Main Posts

16:57

0

Q: Find the pattern v2

Related I feel tired to do "find the pattern" exercise such as 1 2 3 4 (5) 1 2 4 8 (16) 1 2 3 5 8 (13) Please write a program that finds the pattern for me. Here, we define the pattern as a recurrence relation that fits the given input, with the smallest score. If there are multiple answers ...

code-golf math code-challenge

Dennis

@ngn You cannot override a challenge spec with a bounty. If an answer solves only the bounty challenge, we'll have to delete it.

SpookClover

Good or bad: void class members to automatically return the instance (so chaining is easier)

ngn

@Dennis would it be ok if i require answers to include 2 solutions - one with and one without validation?

Dennis

Sure, that's fine.

ngn

17:12

@Dennis i can't edit the bounty description. i'll say it in a comment.

Dennis

@ngn I could refund it, so you can create a new one.

ngn

@Dennis if you have those admin super-powers, sounds great - thanks :)

Erik the Outgolfer

*mod ;-)

Dennis

@ngn Done.

ngn

@EriktheOutgolfer oh, right... "mod" :) i forgot

Anush

17:40

@user202729 Do you suggest I take the original array and its reverse in one set and the set of arrays outputted by your code in another set and look at the symmetric difference?

@user202729 or is there a simpler way to check for uniqueness?

AdmBorkBork

CMC Given two arrays of integers, not necessarily the same length, output the corresponding sums, using 0 for any not-present value. Example: [1, 2, 3] and [-1, 5, 17, 22] output [0, 7, 20, 22]

Dennis

Jelly, 1 byte: +

Erik the Outgolfer

@AdmBorkBork Jelly... ninja

AdmBorkBork

Hehe

A lot of golflangs are going to be like one or two bytes. I'm more interested to see something like V or Brain-Flak or the like. ;-)

Erik the Outgolfer

Brain-Flak...not so sure

you can't separate the two arrays

Dennis

17:55

You could take the lengths.

AdmBorkBork

Well, you know what I mean.

Erik the Outgolfer

or the length ;-)

DJMcMayhem

@AdmBorkBork I think I'll pass on brain-flak because I value my sanity

But challenge accepted for the V

AdmBorkBork

Psh, sanity. That's worth, what, like 25 cents these days?

Erik the Outgolfer

geez, no

sanity is one of the basic pillars of code-golfing

Pavel

18:00

perl "-MList::Util 'max'" -MList::Gather, 66 bytes: sub f{my(\@a,\@b)=@_;gather{take@a[$_]+@b[$_]for(0..max $#a,$#b)}}

Takes two array refs. You get several warnings.

Dennis

Python 2, 45 bytes: lambda*x:map(lambda a,b:(a or 0)+(b or 0),*x)

Pavel

Perl is totally chill with adding undef to stuff

DJMcMayhem

@AdmBorkBork V, 35 bytes: Try it online!

Not quite as gross as I thought it would be

Pavel

@DJMcMayhem Would it be shorter without commas and spaces in input?

quartata

@Pavel At least it gives a warning

Rather than, you know, NaN

Pavel

18:11

So does my (\@a, \@b)=@_

I'd be interested to see what someone who actually knows perl would do since 66 bytes seems way too long

DJMcMayhem

@Pavel Actually, probably not

quartata

@Pavel sorry i cant be bothered

Pavel

Oh ok

quartata

if that was supposed to be my cue

egotistical of me since primo is also in this room and is better

Pavel

I don't think he is

(In this room I mean, I'm not doubting he's better than you)

quartata

18:14

thank

Pavel

:P

J. Sallé

@AdmBorkBork APL (Dyalog Unicode), 26 bytes {(≢⍵)>⍨≢⍺:⍺+⍵↑⍨≢⍺⋄⍵+⍺↑⍨≢⍵}. Can probably be done in like a third of the byte count but I'm too lazy to figure it out.

dzaima

@J.Sallé (+⌿↑)? :p

17 bytes without abusing monadic ↑ (but still abusing it's dyadic version)

J. Sallé

18:30

@dzaima as predicted >.> (I don’t think I’ve ever used ⌿)

dzaima

@J.Sallé I've only used it maybe once before, don't worry :p

Anush

19:47

is there a more succinct way of writing {arr} | {tuple(reversed(arr))} in python?

where arr is a tuple

DJMcMayhem

{arr} | {tuple(arr[::-1])}

Anush

aha! Thanks

it would be nice if arr[::-1] were a tuple

given that arr is

DJMcMayhem

Or even better {arr}|{arr[::-1]} since tuple(arr) is redundant

Anush

oh cool

DJMcMayhem

>>> type(arr[::-1])
<class 'tuple'>
>>>

Anush

19:50

much improved

DJMcMayhem

Why does it need to be a tuple?

Anush

@DJMcMayhem I think sets need tuples not lists

DJMcMayhem

Oh, cause lists aren't hashable

Anush

in python

snap :)

DJMcMayhem

@Anush I've never seen {...} | {...} syntax before

You could do {arr,arr[::-1]} for even more bytes saved

Anush

19:54

@DJMcMayhem that's a very good point

I can't believe I missed that

I am trying to finish of the examples for my question

my code isn't very fast for my fastest-code challenge :)

dzaima

@Adám right, that's been annoying me for a while (though for me it only ever cuts off the bottoms of y, q ect.) Changed the height to the 12px that's the default (from 10px)

Adám

@dzaima Thanks, that works.

Erik the Outgolfer

@Anush btw, why do you need to put a tuple and its reverse in a set?

Anush

@EriktheOutgolfer Let me post the question and then I can explain :)

Poke

PAX East tickets just because available

Anush

20:05

@EriktheOutgolfer I have been making the test examples for codegolf.stackexchange.com/questions/175470/…

@EriktheOutgolfer my slow code creates the set of sums for an array then goes backwards to find all the arrays it could have come from. I need to test if that set is just the original array and its reverse. Because of the way I go backwards using @user202729's code it sometimes doesn't make the reverse

so I need a subset test

hopefully all the test cases are correct now

it was quite a lot of work to make the test cases so I hope someone likes the challenge :)

Poke

became*

New Main Posts

0

Q: Count arrays that are really unique

This is a follow up to Count arrays that make unique sets . The significant difference is the definition of uniqueness. Consider an array A of length n. The array contains only positive integers. For example A = (1,1,2,2). Let us define f(A) as the set of sums of all the non-empty contiguous s...

combinatorics fastest-code

New Sandboxed Posts

20:27

0

A: Sandbox for Proposed Challenges

pentomimo snake Taken from this challenge Given no input, output a representation of a pentomimo snake with the following set up. Use a 5x5 multidimensional array, list of lists or any suitable matrix representation. Number 1 goes in the middle. Make a "snake" of numbers up to 25 so that each...

Transcript for