The Nineteenth Byte

Leaky Nun

11:06 AM

@Tom thx

Luis Mendo

11:21 AM

I have just set a bounty on this challenge. It will go to the shortest answer in a non-golfing language

Mr. Xcoder

@Okx Sorry for disrupting you: I think I'll join another time, I have severe problems with my Wi-Fi, and that's the reason I didn't join when you pinged me in Spyfall. Sorry for interrupting.

Luis Mendo

@Adám MATL, 5 bytes (run-length encoding, maximum, show only top of stack)

Erik the Outgolfer

@Okx invalid

it says length of it not itself

05AB1E, 4 bytes: γéθg

ASCII-only

@LuisMendo Won't Mathematica win :P

Mr. Xcoder

CMC: Find the smallest positive integer x, such that given a positive integer n, n+x form a perfect square. n might be a perfect square itself, and if so x = 0

n = 4 -> x = 0

n = 3 -> x = 1

ASCII-only

11:32 AM

@Mr.Xcoder Are you stealing this for a challenge

Mr. Xcoder

n = 6 -> x = 3

Luis Mendo

@ASCII-only Who knows :-) None of the current two answers is using a builtin that solves the whole task, as is customary with Mathematica

Erik the Outgolfer

@Mr.Xcoder the dejà vu strikes again...

Mr. Xcoder

@ASCII-only It is different than codegolf.stackexchange.com/questions/127187/…

ASCII-only

@LuisMendo Well the current Mathematica solution will certainly beat every single answer in a non-golflang :P

Mr. Xcoder

11:33 AM

Hey, that is asking for primes, not perfect squares

ASCII-only

@Mr.Xcoder JavaScript (ES7), 19 bytes: n=>(-~(n**.5))**2-n

Erik the Outgolfer

@Mr.Xcoder x ≠ 0 if x is positive btw

you should say non-negative

ASCII-only

@EriktheOutgolfer :( would invalidate my answer

Erik the Outgolfer

Jelly, 7 bytes: ‘Æ²Ṇ$¿_

yeah mine too

or this one

Jelly, 5 bytes: Æ²1#_

D:

ASCII-only

@LuisMendo Well there was BifurcationPlot

Mr. Xcoder

11:45 AM

@EriktheOutgolfer No, positive. 0 does not have to be handled

Erik the Outgolfer

but you say find the smallest positive integer x

Mr. Xcoder

@EriktheOutgolfer Oh, yes

I am so dumb

Sorry for that

Arjun

CMC: Given an integer, output its complexity. Unary negation is allowed.

Kritixi Lithos

complexity?

Erik the Outgolfer

@Arjun unclear what you're asking

Leaky Nun

11:54 AM

^

Arjun

Integer Complexity

Leaky Nun

oh

it's a really complicated problem

I wouldn't say that it is a "mini" challenge

Erik the Outgolfer

I think it's been posted though...or something similar?

Kritixi Lithos

@LeakyNun I see what you did there >_>

Arjun

I am going to post that on main. Any suggestions?

Leaky Nun

11:55 AM

@KritixiLithos no pun intended

28

Q: Integer Complexity

Your task is to write a program that, on input n, outputs the minimal expression of each number 1 through n in order. The shortest program in bytes wins. A minimal expression combines 1's with addition and multiplication to result in the given number, using as few 1's as possible. For example, ...

I'll hammer it once you post it.

Arjun

Ah, okay. I won't.

Kritixi Lithos

what are you talking about, puns are always intended :P

Erik the Outgolfer

@KritixiLithos I don't get the pun

Arjun

CMC: Given an integer complexity, output all the numbers having that much complexity.

Erik the Outgolfer

complicated too...

Kritixi Lithos

11:57 AM

@Downgoat my IntelliJ Idea takes a minimum of 5 minutes to load

Arjun

Even more complicated, I guess.

Leaky Nun

@Mr.Xcoder Python, 49 bytes:

def f(n):
 s=n;a=1
 while s>0:s-=a;a+=2
 return-s

TIO

Luis Mendo

@ASCII-only Good point, I skipped that

ASCII-only

@LuisMendo Not sure how anyone would be able to grab a hold of such old software though :P

Erik the Outgolfer

especially pay for it...

ASCII-only

12:00 PM

@EriktheOutgolfer Apparently it's been released for free though?

Erik the Outgolfer

huh?

ASCII-only

@EriktheOutgolfer This isn't Mathematica

Erik the Outgolfer

wait that is from 2001?

or pun intended or something???

ASCII-only

@EriktheOutgolfer ?

Erik the Outgolfer

I mean, was that really released in 2001?

ASCII-only

12:03 PM

@EriktheOutgolfer Yes

Wait apparently it's a Mathematica notebook <_<

Erik the Outgolfer

I don't see where you download it so I wouldn't call it free...

Luis Mendo

@ASCII-only Oh, I got you wrong. I thought you meant one of the two answers was using that!

ASCII-only

Also I kinda want to do it in JS

Erik the Outgolfer

...I think you were supposed to buy a cd and when it got obsoleted they didn't release for free but rather not release at all

ASCII-only

but IDK if I'll have to create the canvas in the function

Especially since there aren't many graphical-output challenges asking for output

@LuisMendo

Arjun

12:21 PM

CMC: Given n, output n ns

Leaky Nun

@Arjun Jelly, 1 byte: x

Kritixi Lithos

Dyalog APL, 2 bytes, ⍴⍨

ASCII-only

@Arjun JavaScript (ES6), 19 bytes: n=>(n+'').repeat(n)

user165474

@Arjun Anyfix, 2 bytes: "x

ASCII-only

@Arjun Python 2, 14 bytes: lambda n:`n`*n

Kritixi Lithos

12:22 PM

markdown bork

Leaky Nun

@Arjun Cheddar, 8 bytes: n->[n]*n

user165474

[Port of Cheddar] Python, 14 bytes: lambda x:[x]*x

user165474

@ASCII-only I don't think that works?

user165474

Eh you probably forgot the brackets

user165474

So mine is a dupe then lol

ASCII-only

12:24 PM

Oh wait array not string

What was I thinking

@Arjun JavaScript (ES6), 19 bytes: n=>Array(n).fill(n)

user165474

@ASCII-only that would give errors too (try ""*""):P

Kritixi Lithos

V, 4 bytes, Ài<C-r>a

Arjun

CMC: Given a String s, output anything not s.

Kritixi Lithos

can the output contain s?

user165474

@Arjun Brainf**k, 17 bytes: ,[>+>+<<-]>[>.<-]

Kritixi Lithos

12:28 PM

can the input be an empty string?

user165474

@Arjun lambda x:x+'1'

Arjun

@Arjun JavaScript, 11 bytes, s=>s==1?2:1

Kritixi Lithos

If the output can contain s (but is not s), then Carrot comes in at 2 bytes, #1

Arjun

@KritixiLithos Yes

Concatenation not allowed

user165474

1 min ago, by Kritixi Lithos

can the output contain s?

user165474

12:29 PM

@Arjun darn >.<

Kritixi Lithos

ninja'd

@Arjun D: carrot used concatenation

Adám

@Arjun I think we had output an n×n×n×…×n (n ns) array of ns on Main.

Arjun

@Adám Yes.

Adám

41

Q: N-dimensional N^N array filled with N

In: Enough memory and a positive integer N Out: N-dimensional N^N array filled with N, where N^N means N terms of N-by-N-by-N-by... Examples: 1: [1] which is a 1D array (a list) of length 1, containing a single 1 2: [[2,2],[2,2]] which is a 2D array (a table) with 2 rows and 2 columns, filled...

code-golf array-manipulation integer generation data-structures

user165474

CMC: Given 0 <= n < 9, output n lines with the k-th line containing k of n.

Adám

12:30 PM

@HyperNeutrino What do the other lines contain?

user165474

@Adám D: what??? lol

Leaky Nun

what is "k of n"?

Mr. Xcoder

So given bith n and k @HyperNeutrino

user165474

@LeakyNun k occurences of n. so like nnn....nnn

Leaky Nun

ok

why < 9?

user165474

12:31 PM

@LeakyNun to prevent the integer from getting too many digits

user165474

sorry I meant <=9

dzaima

@Arjun SOGL, 1 byte: Q

Mr. Xcoder

why ≥ 0 and not ≥ 1?

What would the output be for 0?

user165474

CMC (revised): Given 0 <= n < 10, output n lines where the k-th line contains n repeated k times for all 1 <= k <= n

user165474

@Mr.Xcoder empty or single linefeed, etc.

Adám

12:32 PM

@HyperNeutrino So a triangle?

user165474

@Adám yes

Leaky Nun

@HyperNeutrino I leave Jelly to yourself as a challenge :p

Mr. Xcoder

Test cases?

user165474

@LeakyNun ok :P

user165474

Leaky Nun

12:33 PM

@HyperNeutrino Pyth, 6 bytes: j*R`QS

Kritixi Lithos

wait, doesn't work

Arjun

@totallyhuman హలో

Adám

@HyperNeutrino APL, 4 bytes: ⍴⍨¨⍳

totallyhuman

@Arjun I can't read Telugu lol

Arjun

@totallyhuman Neither can I (I am not south indian) :P

Kritixi Lithos

12:35 PM

If arrays are allowed, then ,\⍴⍨ in APL

Mr. Xcoder

@HyperNeutrino Python, 49 bytes: lambda n:"\n".join(k*str(n)for k in range(1,n+1))

Okx

@HyperNeutrino 05AB1E, 4 bytes: DL×»

user165474

@HyperNeutrino Jelly, 6 bytes: R€ṁ@¹Y

Adám

@KritixiLithos Nice solution too.

Okx

If arrays are allowed, 3 bytes in 05AB1E: DL×

Adám

12:38 PM

@HyperNeutrino Protest, Jelly cannot be longer than APL.

totallyhuman

D:

user165474

If arrays are allowed, 4 bytes in Jelly: R€ṁ@

user165474

@Adám I don't like the @¹ part lol

Leaky Nun

@HyperNeutrino I can do it in 5 bytes

with strings

Arjun

CMC: Given an old CMC's content, output any valid solution to it by looking at replies to that CMC that match the regex /[a-z]+, ?, ?<backtick>.<backtick>/.

Okx

12:40 PM

example?

Arjun

Bonus points for generating a TIO link as well.

Okx

do we get everything as input, so we don't need to use this internet?

Mr. Xcoder

@HyperNeutrino Try it online!... Fixed this time for the Python solution

Martin Ender

@MDXF thanks for the bounty!

user165474

0/10 I use LanguageName, Count bytes: , not LanguageName, Count bytes,

Kritixi Lithos

12:40 PM

@HyperNeutrino I get this `x⁸;\`

user165474

@KritixiLithos darnit you weren't supposed to tell me :( oh well it's alright :) :P

Mr. Xcoder

@MartinEnder What bounty? I am curious to see interesting answer....

totallyhuman

Hexagony answer on...

Kritixi Lithos

@HyperNeutrino but hey, they both have the same bytecount

user165474

39

A: Golf all the 16 logic gates with 2 inputs and 1 output!

Hexagony, 89 bytes Thanks to FryAmTheEggman for some necessary inspiration for the XOR solution. 0000 !@ 0001 ?.|@! 0010 #?#!)@ 0011 ?!@ 0100 +?|@!? 0101 ??!@ 0110 ?<@!!<_\~( 0111 ?<<@! 1000 )\!#?@{ 1001 (~?/@#! 1010 ??|@!) 1011 \#??!1@ 1100 ?(~!@ 1101 ?.|@!) 1110 ?$@#)!< 1111 1!@ All program...

Arjun

12:42 PM

@Okx You get the contents of a CMC. You have to use the internet for looking at all the replies to that CMC message. And then you extract the answers. And (optionally) generate a TIO link from the code).

Kritixi Lithos

it's a port of my apl answer btw

Mr. Xcoder

@HyperNeutrino Thanks, I see now.

user165474

@KritixiLithos yes but mine requires an extra thingy because map weirdness

Okx

@Arjun too complicated as a CMC.

user165474

@Mr.Xcoder lol I just went to his profile (which is an autocompleting URL when I look up Martin) and checked his rep history

user165474

12:43 PM