Biweekly Mini Golf #5

Bubbler

Jul 6, 2021 08:01

Welcome to the 5th Biweekly Mini Golf! During this event, we'll post some CMCs (Chat Mini Challenges) for you all to solve. A new one will be added every 5 to 10 minutes. If you have any questions, don't be afraid to ask. Good luck!

3

in BMG Drafts, 7 hours ago, by Bubbler

Draft: First n terms of 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, ... which has a pattern of [1, 2, 1], [2, 3, 2], ...

Razetime

ngn/k, 16 bytes: {x#,/1 2 1+/:!x}

pxeger

@Bubbler Zsh, 33 bytes: for ((;++x;))eval '<<<$['{,1,}+x]

AviFS

~~APL: Playing around with {0 1 0+¨⊂¨⍳⍵}, but can't get it to work~~ Totally wrong

Razetime

0 1 0∘+¨

and you don't need the ⊂¨

Bubbler

Or (⊂0 1 0)+⍳⍵

Razetime

Jul 6, 2021 08:07

yeah, that's the more APL way of doing it

Bubbler

{⍵↑∊(⊂0 1 0)+⍳⍵) should work I think

pxeger

@Bubbler looks like a kaomoji

AviFS

@Bubbler I was enclosing the wrong side!

Bubbler

@pxeger Is there a way to quit execution early?

pxeger

@Bubbler ato.pxeger.com/…

that'll have to do for now

Bubbler

Jul 6, 2021 08:09

Oh ok

pxeger

I'm working on a stop button :)

It's surprisingly complicated to implement

ovs

05AB1E, 7 bytes: ƵKSλ£₃>

Bubbler

in BMG Drafts, 7 hours ago, by caird coinheringaahing

Draft (inspired by a builtin I just added to my Jelly fork): Given a list (even length) of integers, split into consecutive pairs, sort each pair by its sum, then flatten. e.g. [2,3,6,4,2,1] -> [[2,3],[6,4],[2,1]] -> [[2,1],[2,3],[6,4]] -> [2,1,2,3,6,4]

att

@Bubbler Mathematica, 30 bytes: Join@@#~Partition~2~SortBy~Tr&

Bubbler

@att I always wondered about ~ parsing. Looks like it's left-associative (kind of)

AviFS

Jul 6, 2021 08:13

@Bubbler Brainfuck: +<+[.>+.<.+]

We're supposed to be golfing these, right?

pxeger

@Bubbler Python, 52 bytes: lambda l:sum(sorted(zip(l[::2],l[1::2]),key=sum),())

Bubbler

@AviFS Yes

@AviFS Do you really need <>? :P

Razetime

@Bubbler ngn/k, 20 bytes: {,/{x(<+/'x)}0N 2#x}

AviFS

@AviFS Golfed 1st challenge in BF: +[.>.+<.+]

ovs

@Bubbler APL, 19 bytes: {⍵[⍋2/+/¨⍵⊂⍨2|⍳⍴⍵]}

I feel like there is something shorter for ⍵⊂⍨2|⍳⍴⍵

att

Jul 6, 2021 08:16

@Bubbler ~ ~ is, yes

Bubbler

@AviFS That's wrong, I think +[.+.-.+] should do

Jo King

^

AviFS

@Bubbler Oh... that's good. But I don't think mine is wrong. If you look at the section where it prints numbers, you'll see 010121232...

att

@Bubbler Mathematica, 22 bytes: #+2#~Mod~3&~Array~#/3&

Bubbler

@ovs The only other alternative is to reshape, but (.5×≢⍵)2⍴⍵ isn't particularly short either

in BMG Drafts, 8 hours ago, by AviFS

Draft: Output a magic square with the input number in one of the cells.

att

Jul 6, 2021 08:20

what size square?

pxeger

3x3 I'd assume?

Bubbler

@AviFS I guess you mean 3x3 magic square?

Razetime

size 1x1 lol

AviFS

@pxeger Interrupting execution may be nontrivial, but allowing the user to change the timeout should be an easy temporary fix.

pxeger

hmm I hadn't thought of that

AviFS

Jul 6, 2021 08:21

@Bubbler I thought that initially, but then I decided any size should be allowed to make it interesting...

@Razetime Then again... this. Good one!

I say 3×3 or greater.

Doesn't need to be consistent across inputs

@Razetime With Razetime's idea, we do have an honorary 0 byter in the implicit IO langs

Razetime

ok so wait

pxeger

Polyglot, 0 bytes

Razetime

should it theoretically terminate before the end of the universe

Bubbler

3x3 is still easy: 7 0 5 2 4 6 3 8 1+⊢

Time to compress that digit vector :P

AviFS

@Bubbler Wow... that was clever!

Razetime

Jul 6, 2021 08:25

cause the general short solution would be generating random 3x3's until one of them is a magic square and contains said number

AviFS

I thought one would have to do something like:

betseg

@Bubbler Rust, 86: |n|{let mut m=-1;std::iter::repeat_with(move||{m+=1;[m+1,m+2,m+1]}).flatten().take(n)}

AviFS

n+i  1     2
3    4    n+i
5   n+i   6

Razetime

@betseg memelord has arrived

betseg

im a bit rusty

Bubbler

Jul 6, 2021 08:27

@AviFS That doesn't quite work, but there's indeed a general solution for 2 or 3 givens using a pattern like that

AviFS

No, it doesn't quite work, I know. But I thought something like that. Yours is really clever!

We can move on! Between @Razetime & @Bubbler I think we're good on this, haha

Bubbler

in BMG Drafts, 7 hours ago, by Bubbler

Draft: Given an ASCII string, double each single quote and enclose it in single quotes. "How'd'n't I see that" -> "'How''d''n''t I see that'"

in BMG Drafts, 7 hours ago, by Bubbler

Draft: Given a rectangular 2D string of odd width and height, place the character X at the center.

Posting two because I'm briefly going AFK now

pxeger

@Bubbler the double-quotes on the outside are not part of the input, right?

Bubbler

@pxeger Correct

pxeger

is I/O as a list of codepoints ok?

Bubbler

Jul 6, 2021 08:31

Yes

Razetime

@Bubbler ngn/k, 20 bytes: {a,((1+a=)#x),a:"'"}

@Bubbler this can be a list of strings?

Bubbler

@Razetime yes

Razetime

hm this is not very obvious in K

pxeger

@Bubbler Zsh, 25 17 bytes: <<<"'${1//'/''}'"

Bubbler

@Razetime Likely easier if you take it as a newline-separated string instead

Razetime

Jul 6, 2021 08:38

@Bubbler V(vim), 4 bytes: Try it online!

AviFS

@Bubbler Vim:i'<esc>qqf'l.q9999@qA'

I'm sure V has some loop thing to make 9999×macro less silly

pxeger

@AviFS you're missing an escape there

AviFS

True, thanks

@pxeger Fixed!

@Razetime Nice!

Razetime

@Bubbler yeah probably @[;;] but no clue on what to do

pxeger

alternatively, i'<esc>A':s/'/''/g<cr>

AviFS

Jul 6, 2021 08:42

@pxeger True, but why do that...

pxeger

cos it's shorter and works with more than 9999 apostrophes?

AviFS

Whatever :P

pxeger

@pxeger also missing an escape, and needs to be done in the other order

Bubbler

in BMG Drafts, 7 hours ago, by DLosc

Draft: Given N (0- or 1-indexed), output the Nth element of this sequence:

in BMG Drafts, 7 hours ago, by DLosc

""
\"""\"
\"\\"""\\"\"
\"\\"\\\\"""\\\\"\\"\"
\"\\"\\\\"\\\\\\\\"""\\\\\\\\"\\\\"\\"\"

in BMG Drafts, 7 hours ago, by DLosc

Brownie points to whoever finds the 7-byte Pip answer. ^_^

pxeger

:s/'/''/g<cr>I'<esc>A'

probably something shorter with ctrl-O

AviFS

Jul 6, 2021 08:50

@Bubbler Another lame Vim: 3i 1<esc>b<c-a>qqYp<c-a>w<c-a>w<c-a>q9999@q

Razetime

Pip, 8 bytes: Lax:RPxx Try it online!

@DLosc idk what black magic you've done to get 7

betseg

@Bubbler Rust, 85: |a:&[i32]|{let mut v=a.chunks(2).collect::<Vec<_>>();v.sort_by_key(|e|e[0]+e[1]);v.concat()}

Bubbler

@betseg Isn't v:Vec<_> shorter than the turbofish?

in BMG Drafts, 7 hours ago, by Bubbler

Draft: Given a string, output which-th time each character is appearing in that string. "abracadabra" -> 1, 1, 1, 2, 1, 3, 1, 4, 2, 2, 5

Razetime

@Bubbler 7 bytes: Try it online!

gotteeem

Bubbler

Lol nice

betseg

Jul 6, 2021 08:55

@Bubbler oh yeah

v:Vec<_>=a.chunks(2).collect() for 83

Bubbler

Under CGCC rules you can also cheat and replace i32 with i8 :P

betseg

true lol

i misread mb

Razetime

@Bubbler APL, 28 bytes: {a⊣{a⊢←(⍋b)@(b←⍸⍵=a)⊢a}¨a←⍵}

AviFS

@Bubbler APL, 19 bytes: {+/(⊢×+\)¨(∪⍵)=¨⊂⍵}

@Razetime 'Gottem!

A username

Hi

Just in time

Bubbler

Jul 6, 2021 09:02

@AviFS You don't need ¨ in =¨

AviFS

Thanks! @Razetime was just telling me!

He also says I can trainify!

With (∪=⊂)⍵

Bubbler

@AviFS Train: (+/⊢×+\¨)∪=⊂

AviFS

Holy sh**

Well um, thanks

Bubbler

which is 12

AviFS

Go me :P

A username

Jul 6, 2021 09:04

@Bubbler Vyxal, 6 bytes

ovs

I had `(+/⊢=⊃∘⌽)¨,\`, which is 12 as well

Bubbler

in BMG Drafts, 8 hours ago, by Bubbler

Draft: Given an alphabetic string and a boolean list of the same length, uppercase or lowercase each letter accordingly. "Hello", 0 1 1 0 1 -> "hELlO"

betseg

@Bubbler rust, too long:

|s:&str|{let mut m=std::collections::HashMap::new();for c in s.chars(){let n=m.entry(c).and_modify(|e|*e+=1).or_insert(1);print!("{} ",*n);}}

AviFS

My new nickname, courtesy of @Razetime: AV1 File System

Bubbler

@betseg I appreciate your perseverance :P

A username

Jul 6, 2021 09:07

@Bubbler Vyxal, 11 bytes

pxeger

@AviFS what's AviFS supposed to actually mean?

AviFS

My first name, middle initial, and last initial

... and my social security number

betseg

avi filesystem

AviFS

(But I already used that joke once before...)

A username

@Bubbler Vyxal s, 5 bytes

betseg

Jul 6, 2021 09:10

@betseg at least map.entry(c).and_modify(|e| *e += 1).or_insert(1) is some nice syntax

Razetime

@Bubbler stax, 8: staxlang.xyz/#p=8727895def430c3d&i=[0+1+1+0+1],%22Hello%22

AviFS

@Bubbler Can we take H 0 e 1 l 1 l 0 o 1?

Bubbler

Uh, no

pxeger

pre-zipped would definitely be cheating

A username

@AviFS zip it

AviFS

Jul 6, 2021 09:12

In BF? No thanks!

That's fair though. Had to ask!

A username

@pxeger ^

Bubbler

Well, you can always take input sequentially, come back to start, and destructively handle each pair

pxeger

@Ausername needs to be in an array

["'"]

A username

Oh ok

pxeger

and you probably want to put it in the arguments field, not the options

A username

Jul 6, 2021 09:13

pxeger

it's run as interpreter options code_file arguments

A username

BTW you might want to catch some of those errors...

@pxeger Ok

pxeger

@Ausername I'm logging them deliberately so you can see why you get a red exclamation mark

github.com/attempt-this-online/attempt-this-online/blob/main/…

A username

Ok

Bubbler

in BMG Drafts, 9 hours ago, by AviFS

Draft: Increment every element in the list before or after a zero. (If before & after a zero, you may choose whether to increment once or twice.)

ovs

Jul 6, 2021 09:16

@Bubbler Dyalog Extended, 8 bytes: {⌈⍣⍺⌊⍵}¨

Bubbler

Clarification: "You'll only receive valid input where valid means no consecutive zeroes."

@ovs Nice :P

pxeger

@Bubbler Python, 44 bytes: lambda*x:[[c|32,c&~32][b]for c,b in zip(*x)]

AviFS

@Bubbler Vim again: qqf0b<c-a>2w<c-a>;q9999@q

This actually fails if the first elem is a zero, so it should begin with I <esc>

Unrelated String

@Bubbler Jelly, 7 bytes: ¬Ḋ+ŻƊṖ+

Bubbler

The following is the last one:

in BMG Drafts, 9 hours ago, by AviFS

Draft: Match parens greedily and output everything within matched parens. (6(1(35))(78)9→13578

betseg

Jul 6, 2021 09:22

@Bubbler rust, why do i even keep writing bytes:

|s:&[char],a:&[bool]|for c in s.iter().zip(a){print!("{}",if *c.1{c.0.to_ascii_uppercase()}else{c.0.to_ascii_lowercase()})}

Razetime

@Bubbler BQN, 12: mlochbaum.github.io/BQN/…

A username

My filepath: /documents/go_test/33/xyz/ecl/do-stuff-online/index.html

Bubbler

@betseg for(x,y)in... should save 4 bytes

Unrelated String

@Bubbler Jelly, 9 bytes: ŒuŒlƬZị@"

A username

CMC: Navigate my filesystem.

AviFS

Jul 6, 2021 09:25

AV1 Filesystem is off to bed now. Enjoy the tail end and see y'all soon!

pxeger

@betseg why don't more languages have .0 syntax? It's great

betseg

@Bubbler what if 2 consecutive 0s

Bubbler

11 mins ago, by Bubbler

Clarification: "You'll only receive valid input where valid means no consecutive zeroes."

Unrelated String

"You'll only receive valid input where valid means no consecutive zeroes."

betseg

oh ok thx

Bubbler

Jul 6, 2021 09:30

We're out of CMCs and it's been 90 minutes since start, so the event is officially over. But feel free to post more solutions if you want :)

The Nineteenth Byte

Participants