The Nineteenth Byte - 2017-08-08 (page 2 of 6)

« first day (2383 days earlier) ← previous day next day → last day (2461 days later) »

4:00 AM

Maybe I should just be content with ATaco's hardcoded solution. But at the same time, I feel like I shouldn't settle with a solution that doesn't really do the task at hand.

If this is the case, I might as well rip the solution off of OEIS and maybe port it to avoid duping the language. I don't feel like that's really solving the challenge either.

Somebody please find another graph and tell me I'm wrong

oh

Unless I solve A000669 and use the G.F. for this.

i was close enough :P

@ATaco *nested brackets intensifies*

@totallyhuman, no you may not. — Gryphon 10 mins ago

it's been just under a month

4:03 AM

lol

;_; I am going to sleep before my parents kill me. o/

bye

@HyperNeutrino You should see MaybeLater's

[
  [
    [
      "statement",
      [
        [
          "assignment",
          [
            [
              "indexexp",
              [
                [
                  "var",
                  [
                    [
                      "[a-zA-Z_]\\w*",
                      "a"
                    ]
                  ]
                ],
                [
                  "index",
                  [
                    [
                      "\\[",
                      "["
                    ],

Same deal, harder to keep track.

@MDxf the one night I don't turn off my phone.

I will make your 13 seem

small tomorrow

hi

i am not sleeping

i am a teenager with a cell phone ofc I'm not sleeping at my designated bedtime (or rather, 1.5 hours later)

at least until my wifi disconnects;_;

That's really not good for you, but it's not like I can stop you.

4:18 AM

that's true but I mean I've stayed up later due to school, and I wake up later than during the school year by enough that I'm getting more sleep than during school year

@ATaco well you could by framing me for some SE thing and getting my account banned, which would cause me to go to sleep earlier because I can't use PPCG

Nah, I'll just give the promise of better sleep and general well being.

:P Maybe I should listen to you :P

Probably would be smart but this math thing exists

what might help is if someone does the next one and then I wouldn't be able to answer anyway

but please don't do that I want to figure this out and I am discontent with hardcoding lol (no personal offense intended (:)

(noonebox) xkcd.com/541

@ConorO'Brien sorry D:

@ATaco that's what I was thinking too xD

4:29 AM

Does anyone know why esolangs.org is down?

idk, check the contact section for it and ask them /s

o_o

Here: ಠ_ಠ

yes that :P stupid RasPi

I think ais523 is an admin on esolangs, but ais appears to be gone.

You can make arbitrary length kannadan faces by insering more underscores: ಠ______ಠ

5:05 AM

Yesterday I capped and lost 100 DAT impossible >.<

1 hour later…

6:22 AM

1

Q: Space Navigation

Oh no! There are a bunch of meteoroids on my way through the universe ... what am I and my space ship, the SP4C3, supposed to do? I need to manoeuver my shuttle through these rocks or I am done for! Your Task Write a program that guides my shuttle through a map of asteroids, using as few bytes...

0

Q: Find the tangent of the sum of inverse tangents

Background It can be shown that for any integer k >= 0, f(k) = tan(atan(0) + atan(1) + atan(2) + ... + atan(k)) is a rational number. Goal Write a complete program or function which when given k >= 0, outputs f(k) as a single reduced fraction (the numerator and denominator are coprime). Test ...

code-golf math sequence

2

Q: Should every question be sandboxed?

A while ago I started a bit of a personal experiment and stopped using the sandbox for most of my questions. I think this experiment has given me a new perspective on the sandbox, that I would like to share. The sandbox is problematic. Many users feel that they can't get the necessary feedback...

discussion sandbox

@totallyhuman already done, that's the upside down ice cream cone

1 hour later…

7:56 AM

hi

0

Q: Deleting sandbox answers gives 'Disciplined' badge

When you delete your sandbox answer (question), if it has a score of 3 or more, you get the badge 'Disciplined' on meta. I know it's supposed to do this, but it does not really make sense for the sandbox, so I'm requesting it to be removed on the sandbox.

feature-request

Anyone good at golfing ><>?

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Words crossing over code-golfstringascii-art Input: Two strings. Output: Both words/sentences start on lines with one empty line in between them. They 'walk' horizontally 'next to each other'. But when they have the same character, they cross each other, and then continue walking 'next to ea...

8:38 AM

@Mr.Xcoder ????

@ASCII-only Sorry, misread the question

Nevermind

:)

That's the trouble with an all-punctuation language name...

Yeah true ^

my only experience with ><> is with polyglots

CMC: Given an integer, find its prime factors. Then deduplicate the list and take its product again.

16 -> prime factors: [2, 2, 2, 2] -> deduplicate: [2] -> product: 2

10 -> prime factors: [2, 5] -> deduplicate: [2, 5] -> product: 10

8:41 AM

@Mr.Xcoder Braingolf, 4 bytes: pu&*

in this case, depulicate would be equivalent to unique?

@Mayube O_o

@Cowsquack yes

Nice, Braingolf is golfy for this task

@Cowsquack Yes

p is get prime factors, u is remove duplicates, &* is product

Jelly should be 4 or 5 too

8:43 AM

Octave, 27 bytes, @(x)prod(unique(factor(x)))

Nice +1

I think Jelly is longer than Braingolf >_>

not sure how to get the product of a sequence in Pyth, but {P gets unique prime factors

Does anyone here rn use Pyth?

@Mayube I was about to ask that. i have never encountered that in Pyth either, although I use it much

CMC: do Mr. Xcoder's CMC in sed

@Cowsquack No thanks

8:48 AM

problem with Jelly's prime factorization is it does [factor, exponent] pairs

so 16 becomes [2,4], not [2,2,2,2]

@Cowsquack And BTW, why do you all call me Mr. XCoder?

I never figured that

halp how do i loop while there are matches in sed

CMC: Given an integer, return it's smallest digit

what do you mean? @ASCII-only

5 bytes in Jelly

ÆFḢ€P

(for my CMC)

Yaaay, 10k network rep!

8:52 AM

eg: 1234 -> 1, 7489 -> 4 999909 -> 0

@Mayube I assume we cannot take a list of digits instead, right?

correct

@Cowsquack nvm

you can do /regex/t<label> for a conditional branch

0

Q: How to count bytes in TeX?

I have a bit of unclarity in regards to how we should count bytes in TeX. In general, coding in TeX is done through macros, introduced by the escape character. for examples \read16 is the macro which takes stdin. I would like to know if we could count that as 1 byte for the following reason. T...

8:54 AM

@Mayube Pyth, 5 bytes: hSvM`

Pyth, 5 bytes: hSjQT

t label Branch to label only if there has been a successful substitution since the last input line was read or conditional branch was taken

Braingolf, 2 bytes: dx

Pyth, 5 bytes: hSsM`

Too many 5-byters

on the topic of working with the digits of integers

CMC: Given a list/array of positive integers, return a list/array of the first digit of each integer

@Mayube Interesting

8:58 AM

eg [123, 987, 456] -> [1, 9, 4]

can the resulting array be a string (an array of chars)?

sure

Braingolf can do it in 4 ;)

as can Dyalog APL

⊃∘⍕¨

@Mayube Pyth, 3 bytes: mh`

Haha

touche

9:00 AM

touche

Braingolf: (d<)

Give me more CMCs

CMC: Create an interesting CMC

@Mayube CMC: Create an interesting CMC

I want to practice my Pyth and think about things to add to CThulhi

9:01 AM

CMC: Calculator in sed

jk i'm doing that i want the bounty

@ASCII-only Too much for us

there's a bounty for that

ninja'd

@Mayube SOGL, 2 bytes: HJ (→ added for ease-of use as it expects input on stack)

forgot how to do order of operations like is it multiply -> etc -> remove redundant parens -> repeat?

I love the compatibility mode :)

9:02 AM

@Mayube sed, 7 bytes, s/.//2g

I'm not entirely sure how that works

CMC: Given a list/array of integers, return a count of the prime numbers in the list/array

@Mayube Given a list of positive integers, return the second digit of each

@Mr.Xcoder Braingolf, 5 bytes: (d<<)

@Mayube Pyth has m@`d2

@Mr.Xcoder SOGL, 3 bytes: HjJ

9:03 AM

what about the last digit?

@Mayube 4 bytes

3 bytes ;)

(d)

@Mayube Sorry, 3 bytes

Also, in response to my other CMC, braingolf, 4 bytes: &I&+

let's not have trivial variants of the same cmc

9:05 AM

Here is the last digit: me`

@Cowsquack we've already moved on from that, we're on prime counts now

@Mayube lfP_TQ

Also there's /mP_dQ1

Braingolf's really golfy at specific challenges, and really bad at everything else

@Mayube would be HK, but as SOGL wraps around the array when I/H (rotate clockwise/counter-clockwise) is used it only works when all number lengths are equal

@Mayube Is the input guaranteed to contain primes

?

9:07 AM

No

Ahhh

I would've done it in 5 if so: l.MP_

lfq1lPTQ

@Mayube Octave, 19 bytes, @(x)sum(isprime(x))

O still like lfP_TQ

Given a list of integers (higher than 1), find the sum of the prime factors of all integers

@Mr.Xcoder given an integer, return the number of digit runs in the integer
Eg: `112233441234 -> [11,22,33,44,1,2,3,4] -> 8`

[10, 16] -> prime factors: [2,5,2,2,2,2] -> sum: 15

@Mayube Ok, working on that

9:11 AM

@Mr.Xcoder Braingolf 6 bytes &(p)&+

Pyth, 4 bytes (my CMC): ssPM

wait wtf am I doing

I don't know :)

wtf why doesn't p support greedy in braingolf

dammit

otherwise would just be &p&+

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Related. The ASCII Composer code-golf ascii-art Back in the days, where beautiful 300 DPI printing was not invented and computers started getting popular, composers were intrigued to try making their compositions visible on the computer screen. Your Task Given an input of notes, output a s...

9:13 AM

@Mayube 3 bytes but by some reason doesn't work online

Braingolf, 2 bytes: Gl (my CMC)

@Mayube Jelly, 3 bytes: ŒgL

Pyth does not have a built-in, I won't bother to solve it in Pyth too

CMC: Given a string containing both lowercase and uppercase, return the number of vowels in the string (y is not a vowel)

@Mayube Sure

@Mayube bash, echo $1|sed 's/\(.\)\1*/1+/g;s/.$//'|bc

9:17 AM

@Mayube I expect this to be 2 or 3 bytes in Jelly.

@Adám No, about 5

or 4

4 bytes in braingolf: &J&+

@Mr.Xcoder Why? member-of no-Y-vowels, sum

@Adám Vowels is 2 bytes.

@Mr.Xcoder Ah, that's right.

9:19 AM

@Mayube Jelly, 4 bytes: ØcḟL @Adám

bash, echo -n $1|sed 's/\(.\)\1*/a/g'|wc -c (to the older cmc, but golfed slightly)

@Mayube @Everyone Given a list of characters, sum their ascii values :)

@Mayube APL, 8 bytes: +/2≠/0,⊢

@Mr.Xcoder Braingolf, 2 bytes: &+

Pyth, 3 bytes: smC

@Mayube ascii value, sum?

9:22 AM

@Mayube bash, 32 bytes, echo $1|sed s/[^aeiou]//ig|wc -c

@Mr.Xcoder no, just greedy sum

Or: sCM

braingolf converts everything on it's stack to integers, characters are converted to their unicode codepoints

See?

@Mr.Xcoder K, 2 bytes: +/

Jelly, 2 bytes too: OS

9:23 AM

@Mr.Xcoder Dyalog APL, 6 bytes, +/⎕UCS

Oh, so coool. I saw a blue bubble like a chat notification but those are flags of spam

CMC: Given no input, Output 7000

@Cowsquack You should know better: Is that because I hit 10 k network rep?

Pyth, 7000

Braingolf: *7*

@Mr.Xcoder what?

9:25 AM

The shortest in Pyth is 7000. The non-trivial version is *7^T3

@Mayube SOGL, 3 bytes: ¡⌠“

@Mayube APL J, many more; 3 bytes: 7E3

@Cowsquack The blue bubble with spam/offensive flags

I didn't flag anything

Given no input, output -1000000 (negative 1 million)

9:26 AM

APL, -1E6

@Cowsquack Not you. I asked you why I see flags. Because I hit 10k network?

@Cowsquack Works in many many languages.

Jelly, 3 bytes: 7ȷ3

(Jelly is more special)

hmm gimme a sec

@Mr.Xcoder then yes, 10k network rep gives you the ability to see chat flags

9:27 AM

ah there we go, Braingolf, 5 bytes ^..&-

@Cowsquack Thanks, that's why I was asking you, because you have over 10k

@Mayube Jelly, 2 bytes: 7ȷ

@Adám Ddi you just outgolf me?

@Mayube Jelly, 3 bytes: _ȷ6

@Mr.Xcoder Yup, in Jelly!

@Adám I think you just tried to remove the 3 and see what happens, or you've seen that somewhere else

9:30 AM

@Mr.Xcoder I remembered that the default exponent is 3 and the default mantissa is 1. (github.com/DennisMitchell/jelly/wiki/…)

Ok

CMC: Given a list of positive integers, return all the numbers with the digits in reverse order, summed

[12, 32, 14, 5] -> reversed: [21, 23, 41, 5] -> sum: 90.

@Mr.Xcoder APL, 5 bytes: +/⍎⌽⍞

woah, that's too golfy

Braingolf, 9 bytes: (d&,&g)&+

@Adám Are you sure APL is not, in fact, a golfing language?

xD

9:32 AM

> too golfy

get out

Pyth, 5 bytes: sms_`

@Adám Now that's better

@Mr.Xcoder SOGL, 4 bytes: r±r∑ (as always, ignoring →)

@Mr.Xcoder Works on Android and iPhone?

@dzaima No, as integers only

@Adám What do you mean?

Short Message Service (SMS) is a text messaging service component of most telephone, World Wide Web, and mobile telephony systems. It uses standardized communication protocols to enable mobile phone devices to exchange short text messages. An intermediary service can facilitate a text-to-voice conversion to be sent to landlines. SMS was the most widely used data application, with an estimated 3.5 billion active users, or about 80% of all mobile phone subscribers, at the end of 2010. SMS, as used on modern handsets, originated from radio telegraphy in radio memo pagers that used standardized phone...

9:34 AM

hehe

@Adám Ah lol

@Mr.Xcoder Wait, no STDIN input?

@Adám Oh, STDIN is fine

But you are not allowed to put quotes or something

@Mr.Xcoder STDIN is always text, no?

@Adám See the second message

You can take them like [1234, 1234] but not as ["1234", "1234"].

9:35 AM

I really need to work on verbosely again at some point

I really need to outgolf you all in Osabie

@Mr.Xcoder OK?

@Adám Sure, that's ok

CMC: e

*1?

9:37 AM

Hooray, 05Ab1E, 2 bytes (my CMC): íO. I love outgolfing Jelly

@Adám Braingolf, 1 byte: f? :P

@Cowsquack Yes. But without questionmark.

@Adám The constant?

@Mr.Xcoder Yes.

2.718281828459 (polyglot)

9:39 AM

@Mayube Uh, TIO?

@Adám I was joking

@Adám Jelly, 2 bytes: Øe

Erik the Outgolfer

any feedback to this?

ooh, a tie between Jelly and APL

@Adám Charcoal, 3 bytes: Ｉ≕E

:| charcoal has to cast whyyyyyyy

9:42 AM

Poor Pyth doesn't have e at all

@Cowsquack Yes, but technically, APL is shorter there. Jelly uses a constant (equivalent to the non-exiting ⎕e), while Jelly's equivalent of APL's monadic * is two bytes: Æe, so you need 1Æe.

Cthulhu, 2 bytes: «e (for now, in theory, when I ~~finish~~ start it)

@Adám Multiplication between constants and 1 isn't really a thing in Jelly

@Mr.Xcoder Huh? that isn't what it does. It raises e to the power of 1.

Erik the Outgolfer

@Mr.Xcoder you say?

Pyth, 3 bytes: .n1

@EriktheOutgolfer Lol, I searched for euler

Such a rich description, 1 byte: e

Erik the Outgolfer

9:46 AM

eu-what? I just searched for .n

CMC: Given a list/array of integers, output the number of prime deltas

@EriktheOutgolfer I didn't know of .n stuff because I mainly did digit manipulation and ascii art in Pyth

@Mayube Prime delta?

Erik the Outgolfer

@Adám probably first do deltas and then count the primes

^

9:47 AM

@Adám Prime differences between elements

@Mayube Test case

so for [2,4,6] the deltas are [2,2], both of which are prime, so the output should be 2

As soon as we're doing anything with primes, Dyalog APL is out. J uses multi-char primitives, and NARS APL uses 2 bytes per char… :-(

but for [2,4,8] the deltas are [2,4], so the output should be 1

@Mayube Pyth, 7 bytes: lfP_T.+

Erik the Outgolfer

@Mayube Pyth, 7 bytes: smP_d.+

9:48 AM

Nonono

There is a shorter way

lol

Erik the Outgolfer

@Mr.Xcoder yeah

Braingolf, 5 bytes: f&I&+

Erik the Outgolfer

...or not

No, there isn't Ω_Ω

@EriktheOutgolfer We both did it well then

Erik the Outgolfer

9:51 AM

because the "shorter" way was in fact 9 bytes: /mlPd.+Q1

FGITW: max(ⁿ√n), n∊ℝ, n>0 (i.e. which number n yields the largest nth root of n?)

Yeah, crappy

@Adám Generic root from... self?

@Mr.Xcoder Yup.

@Adám test case xD

@Adám Pyth, 1 byte: @

Erik the Outgolfer

@Adám you mean the value it converges to? well there's only an approximation for that...

oh wait nvm

9:52 AM

Sorry, misunderstood

Yay for arbitrary precision E

:| can't print it normally though because i didn't implement Cast properly i'll have to fix that

CMC: Given an integer, return the (positive) primes strictly lower or equal to itself.

@Mr.Xcoder That's the function. Now which input yields the largest output?

Erik the Outgolfer

@Adám 3

oh wait is it supposed to be an integer?

> n∊ℝ

@Mr.Xcoder Pyth, 4 bytes: {P.!

Erik the Outgolfer

9:54 AM

@Mr.Xcoder Jelly, 2 bytes: ÆR

@EriktheOutgolfer No, any real number.

Erik the Outgolfer

there goes my 3...

wait it still seems to be 3

CMC: Given an integer as input, output the input, unless the input is 5, in which case output 6

@EriktheOutgolfer I think you meant ÆC instead

@Mr.Xcoder no, that returns the number of primes, not the actual primes

9:57 AM

@Mayube >_> so creative >_>

Erik the Outgolfer

no ÆC is the count ÆR is the range

Oh yeah sorry

@EriktheOutgolfer No, ²∙⁹√2.9 > ³√3

Erik the Outgolfer

@Mayube Jelly 3 bytes: ⁼5+

@Mayube 5=+

Erik the Outgolfer

9:58 AM

or all-ascii version: =5+

@Mr.Xcoder there's actually a sort of story behind the CMC, it's not just an arbitrary challenge

@Mayube APL: ⊢+5=⊢

Erik the Outgolfer

still ⁼5+ :p

or more creative but way longer

@Mayube J: +5=]

Erik the Outgolfer

ÆPȧÆC⁼3+

9:59 AM

braingolf isn't great with conditionals: 5!e6:$_|

@Mayube Pyth +^Zn5

Without conditionals

Erik the Outgolfer

Try it online!

@EriktheOutgolfer Like my Pyth solution?

« first day (2383 days earlier) ← previous day next day → last day (2461 days later) »

Transcript for

Aug '178

The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC

site design / logo © 2024 Stack Exchange Inc; legal

mobile