The Nineteenth Byte

Q: Print the total length of all "quoted" characters

8:52 AM

Rules In this challenge, I'm going to redefine the definition of "quotes" a bit. Quotation marks (AKA quotes) are any identical characters used in pairs in various writing systems to set off direct speech, a quotation, or a phrase. The pair consists of an opening quotation mark and a closing q...

code-golf string number

Arnauld

9:21 AM

@Mego @Dennis @DJMcMayhem Could you please clear the comments for this challenge? (it was edited and undeleted, following another user's suggestion -- although I personally think that it would have been better to just re-post it as the OP initially did)

4 hours later…

Dennis

1:26 PM

@Arnauld Done.

Q: Find the C-factor of a vote

In this challenge you will be determining how controversial a vote is, given an array of other votes, by figuring out a number called the C-factor. What is the C-factor, you ask? Well, imagine you've got multiple votes on an election. We'll use 1 and 0 for the sake of the challenge to represent ...

code-golf math function

Arnauld

1:44 PM

@Dennis Thank you :)

3 hours later…

Adám

4:17 PM

CMC: Given a Boolean List B and a number N, answer with N times the number of trailing Trues in B. For example [1,0,1,1,1], -1.5 → -4.5

Ooh, something brain-flak is actually good at!

@Adám Brain-flak (plus -r flag), 30 bytes: ({}<>)<>({<{}><>({})<>}<><{}>)

Python 3, 29 bytes: lambda l,n:l[::-1].index(0)*n

A 1 byte difference

4:33 PM

Stupid snmpwalk

Q: Convert a string containing integers to list of integers

What is the shortest way to convert a string containing integers separated by spaces to a list of integers? input : "-3 1 5 8 10" output : [-3, 1, 5, 8, 10]

code-golf python

@DJMcMayhem Pseudocode: tio.run/##TY0xCsMwDEV3nULQRaIQOhdyktIhbgURSVXhOOnxHWE89E/iPfH/…

@Adám 35 bytes

4:48 PM

@NewMainPosts This trick is really cool: eval(s.replace(*" ,"))

Looks like witchcraft to me

That's a burnin'

I see @SriotchilismO'Zaic has entered the room. Have the words "brain-flak" summoned you? :P

yes

I'll be impressed if you see a way to shave any off. I can't see anything.

Perhaps a harder challenge would be doing it without the -r flag

Yeah it looks pretty tight

5:06 PM

@DJMcMayhem 48 without -r

@Adám Dyalog Extended, 5 bytes; arr⊥scalar is still pointless imo

oh hmm doesn't work with an empty array

@Adám Haskell 46 bytes

2 for a binary list instead of a boolean list

@dzaima 9 bytes working with an empty array

Adám

@dzaima But can you do it in 3?

uh 20 bytes not 2

5:47 PM

@Adám can't think of anything

aditsu

cjam: \e`W=~**

6:21 PM

@Adám MATL, 5 bytes: PYp*s

6:35 PM

Q: Impossible darts scores

I was surprised to not find this asked already, though there is a great question on darts checkouts: Darts meets Codegolf Your challenge is to calculate which scores are not possible with 'n' darts below the maximum score for 'n' darts. E.g. for n=3, the maximum possible score is 180 so you woul...

code-golf

7:01 PM

CMC: Given a list of integers, return the same list with the largest run of equal integers removed. If there's a tie for length, remove the earliest appearance.

[1, 2, 4, 1, 6, 6, 2, 3] --> [1, 2, 4, 1, 2, 3]
[1, 2, 3, 4, 5] --> [2, 3, 4, 5]
[4, 4, 3, 2, 5, 6, 5, 4, 3, 8, 7, 6, 6, 6, 5, 9, 3] --> [4, 4, 3, 2, 5, 5, 4, 3, 8, 7, 5, 9, 3]

[4,4,6,6] -> [6,6] might be a decent test case

Granted, that's just 1..5 now that I think about it

Yes. And also [1] --> [] or [2, 2, 2, 2] --> []

@Veskah Yeah, they're similar