The Nineteenth Byte

HyperNeutrino

20:00

o_O

Dead Possum

XD

flawr

there is even a challenge with a french title with errors

Jordan

Yeah I like that compromise too. The name was the issue (I think, flawr may disagree) and keeping the name in Russian removes the issue

Dennis

@flawr Well, at least it's better than Многочлены Chebyshev.

flawr

@Dennis well I agree on that

Dead Possum

20:01

Многочлены Chebyshev'a

Jordan

Многочлены Chebyshev(a?)

ppperry

@flawr Again, that one is about a non-english language

This challenge isn't

Dead Possum

Chebyshev's многочлены

trichoplax

I'm not a huge fan of non-English titles, but I'd much prefer that to a long English back story

HyperNeutrino

@flawr The thing about that is that it uses (almost) all English characters, and one can see from a first glance approximately what it means (Imperfections is an English word, and francais is pretty well-known to mean French)

flawr

20:03

I should have actually used the german transliteration as it is probably the most common in the pre internet literature

AdmBorkBork

@Dennis This compromise is also in line with other non-English names, like Erdős

xnor

seeing a foreign-language title makes me expect a challenge about that language

Jordan

@xnor but what if you saw something like "Erdős Numbers"

xnor

@Jordan then I'd expect it to be about Erdős Numbers

Dead Possum

@WheatWizard I need your opinion. This doesn't do s..tuff. -V doesn't help to.

Jordan

20:09

Right

@DeadPossum You getting Closer? I hope so!

HyperNeutrino

@DeadPossum The IP could start anywhere

Dead Possum

@Jordan I hope too!

@HyperNeutrino I know <_<

Wheat Wizard

@DeadPossum If you download the interpreter you can use -d to watch the program run

HyperNeutrino

so if it starts on the end of the first line going down, then it will be stuck forever

Wheat Wizard

I'd be willing to help thought

Dead Possum

20:10

@HyperNeutrino I would have some direction at start

HyperNeutrino

I'm glad I set up the Proton parser using a regex-like engine. It literally took me one minute to add while loops to the language :P

Dead Possum

@WheatWizard Ok, I'll try it

ppperry

may I point out that the lost interpreter crashes if you give it an empty command line argument

Step Hen

@HyperNeutrino nuuuu not regex

HyperNeutrino

@DeadPossum It could be doing that though

@StepHen my lexer is almost purely regex and my parser works similarly :P

Step Hen

20:11

@HyperNeutrino but... but... but... regex :(

HyperNeutrino

:3

Wheat Wizard

@ppperry Thanks. Most interpreters I know do that. It has to do with the way TIO formats input, thats not to say it can't be fixed.

ppperry

oh

Step Hen

@WheatWizard Dennis asked me to add a try... except for my interpreter for that I believe

but that was for input not for args

HyperNeutrino

I should add variable scoping into my language. Right now everything is global.

Wheat Wizard

20:12

I'm sure I could do that.

Step Hen

@HyperNeutrino adding an extra if statement doesn't that that long either

Dead Possum

@HyperNeutrino Oh, now I see that. Gotta fix, but nonetheless, other entry points (lots of) should do the job right. should

Wheat Wizard

@DeadPossum What is the general plan for the quine?

HyperNeutrino

@DeadPossum Yeah. Hopefully :P

@StepHen adding ifs were the hardest thing because it was the first block statement that I added. Everything else got easier as I got used to my parser's pattern matching engine

Step Hen

@HyperNeutrino no, I mean that adding an if to a parser isn't that much longer than adding something to regex

HyperNeutrino

20:14

oh

Yeah I guess?

I mean to add while loops to my language all I needed to do was add a single line into the parser:

PatternMatcher([('keyword', 'keyword', 'while'), ('expression',), (('expression', 'statement'),)], lambda x, y, z: x.addChild(y).addChild(z).addType('statement')),

Step Hen

eh I think I just personally can read a char by char parser 10x easier than regex

HyperNeutrino

And 3 lines into my interpreter

elif tree.token.content == 'while':
    while hardeval(tree.children[0], symlist):
        evaluate(tree.children[1], symlist)

Step Hen

yeah I can't read that one bit

Dead Possum

@WheatWizard Well, I started with 2-liner (sadly already scrap it) like that

HyperNeutrino

@StepHen wait char-by-char parser? o_O or do you mean token-by-token

Step Hen

20:15

@HyperNeutrino sorry token by token yeah

the lexer is the char by char

HyperNeutrino

@StepHen IMO it's a lot easier to read, and even if not, a lot easier to write.

Dead Possum

@WheatWizard Than I understood that ! in >?!< can't exist in 2-liner and I need 3rd

HyperNeutrino

@StepHen ah ok. I used to do char-by-char languages and then char-by-char lexers, but I find regex lexers so much easier to use and much more extendable and maintainable.

Mr. Xcoder

Code Golfer's Corner is frozen :'-(

HyperNeutrino

rip

Wheat Wizard

20:16

@DeadPossum There are ways to make two liner loops

HyperNeutrino

how do you prevent a one-liner from starting from a non-directional char and going down (thus looping infinitely)?

Dead Possum

@WheatWizard Hm.. If anything in one-liner is not a direction command, it may stuck, going up or down

Mr. Xcoder

@HyperNeutrino What's up with Biweekly contest for undervoted answers?

Wheat Wizard

Yeah I made a mistake I meant 2

HyperNeutrino

@Mr.Xcoder Oh it died.

Mr. Xcoder

20:17

Will we do anything with it, in the end?

HyperNeutrino

not enough people using it

Mr. Xcoder

@HyperNeutrino rip :'-(

Dead Possum

Same thing with 2-liner and !. It will stuck going up or down

Wheat Wizard

@DeadPossum >?"v"0*+ should work as a 2 liner

Step Hen

@HyperNeutrino ok I get it, you're skipping the lexer completely

the regex is the lexer

HyperNeutrino

20:18

essentially

Step Hen

yeah I don't like that, regex becomes a mess

imo

HyperNeutrino

I have a list of lexer rules and it matches the code against each rule until it finds one and then gets a token from it

For example the regex rule to find string literals is just this:

Jordan

@StepHen regex IS a mess

HyperNeutrino

RegexMatcher(r'"([^"\\]|\\.)*"', 0, 'literal:expression', lambda x: ast.literal_eval('""%s""' % x))

you might prefer just storing whether or not the lexer is in string mode for each character but I find that to be more of a pain.

Dead Possum

@WheatWizard It may be too late in night, but I don't get this one :c

Step Hen

20:20

elif self.cur == LITERAL_QUOTE:
       self.advance()
       temp = self.read_literal()
       self.advance()
       return temp

HyperNeutrino

much longer

Step Hen

that's what I do

but so much more readable

Wheat Wizard

@DeadPossum We use a string to get past the v instead of a jump.

HyperNeutrino

also that's not char-by-char either

Step Hen

@HyperNeutrino yes it is

HyperNeutrino

20:20

oh wait nvm

Jordan

@DeadPossum Someone earlier said you don't have @ in your code, are you adding that later? (with % as well)

Step Hen

that's the lexer

HyperNeutrino

read_literal is probably char-by-char too.

Step Hen

@HyperNeutrino yup

Dead Possum

@Jordan there is @ and %

Step Hen

20:21

def read_literal(self):
        result = ""

        while self.cur is not None and self.cur != LITERAL_QUOTE:
            result += self.cur
            self.advance()

        return Token(LITERAL, result)

Dead Possum

@WheatWizard Oh, get it now

Step Hen

a lot more readable imo

HyperNeutrino

@StepHen how do you escape strings?

Jordan

@DeadPossum oh yeah duh

Dead Possum

@WheatWizard still need a way to clear stack without !

Mr. Xcoder

20:21

CMC: Sum the suffixes of a list.

Jordan

Shouldn't skim code lol

Step Hen

@HyperNeutrino I don't yet, I told you I don't really have strings

Wheat Wizard

@DeadPossum That will do it

HyperNeutrino

@StepHen Oh is this the cQuents lexer?

Mr. Xcoder

[1,2,3,4] -> suffixes: [[1,2,3,4],[2,3,4],[3,4],[4]] -> sums: [10, 9, 7, 4]

Wheat Wizard

20:22

Well it leaves a zero on the stack technically

Step Hen

I'm going to rewrite the interpreter with SBCS and get rid of all my two-byte crap and actually do string sequences

@HyperNeutrino yeah

Dead Possum

@WheatWizard Yeah, now I see. Gotta go rest soon -_-

HyperNeutrino

@Mr.Xcoder U+\U

@StepHen Ah okay. That makes more sense.

Wheat Wizard

Ok good luck

Mr. Xcoder

@HyperNeutrino :'-( shorter built-ins: sM.__

HyperNeutrino

20:23

@Mr.Xcoder hehe

Jordan

Can Lost start in lines other than the first line?

HyperNeutrino

(sorry WW)

@Jordan It can start anywhere and go anywhere.

Tobi

This is the most efficient way to do spacial partionining checks, right?

Wheat Wizard

@HyperNeutrino What are you sorry for?

HyperNeutrino

._.

@WheatWizard I accidentally pinged you lol

Wheat Wizard

20:24

Oh I missed it

Mr. Xcoder

@WheatWizard Shorter built-ins

HyperNeutrino

lol ._. heh

Jordan

Lost is way above my skill level haha

Wheat Wizard

Didn't miss that one

Jordan

Not even gonna try it

AdmBorkBork

20:24

@Mr.Xcoder PowerShell, 51 bytes -- Try it online!

Wheat Wizard

@Jordan It might be helpful to check out the programs people have already writen

There are some techniques that are helpful

Mr. Xcoder

Darn, I hit repcap 2 1/2 hours ago ._. Now I must wait for tomorrow to post a challenge I didn't yet write ˘V˘

HyperNeutrino

lol

tomorrow is in 3.5 hours

Mr. Xcoder

Meeeeh :'-(

Step Hen

@Mr.Xcoder sandbox is your bestest friend

Jordan

20:26

@WheatWizard Still trying out Befunge98. Solved a CMC in it earlier with very very little help! Simple CMC's would help ;)

AdmBorkBork

@Jordan xcoder just posted one

Wheat Wizard

Try Summing all the even numbers from 0 to n

Step Hen

@WheatWizard cQuents, ;$

Jordan

@AdmBorkBork Sadly I don't know any way to input a list in befunge and I think it's a bit too complicated

@WheatWizard Will do! Thanks!

Step Hen

CMC: nth even perfect square

Mr. Xcoder

20:28

@StepHen No, it's not... I don't post easy challenges in the SB anymore, because then people like Peter Taylor complain that I leave it there for a very short period of time :(

HyperNeutrino

@WheatWizard Jelly: RḂÐḟS

@StepHen Ḥ²

Step Hen

@HyperNeutrino holy crap that's long

Jordan

@WheatWizard Won't solve this in chat as I'm at work and need to do some coding but trust that I'll solve this on my own :-)

Mr. Xcoder

@HyperNeutrino Doesn't ² suffice?

HyperNeutrino

... nth even perfect square?

Mr. Xcoder

20:29

@HyperNeutrino Yeah, noticed after I hit send

HyperNeutrino

@StepHen probably could be shorter (literally just range, remove odd numbers, sum)

@Mr.Xcoder ah ok :P

CMP: Who actually hits the "send" button?

Step Hen

@StepHen btw that's wrong

Mr. Xcoder

@HyperNeutrino The poster of a comment ?

Step Hen

@HyperNeutrino Me after I click "fixed-font"

Wheat Wizard

@StepHen Brain-Flak 26 bytes

Jordan

20:30

@HyperNeutrino Luddites

AdmBorkBork

@WheatWizard PowerShell, 35 bytes -- Try it online!

HyperNeutrino

CMP: Who actually hits the "fixed-font" button?

Mr. Xcoder

@HyperNeutrino me

HyperNeutrino

Ah okay. I'm too lazy to do that :P

Step Hen

@HyperNeutrino who actually puts 16 spaces in?

HyperNeutrino

20:31

@StepHen Ctrl-K?

Business Cat

@StepHen Your 10, 6, [1, 16] test case on the hydra question is making my Prolog program recurse infinitely >=(

Step Hen

@BusinessCat I dunno if 1 is a valid sector or no, but that's weird

Business Cat

I can't figure out how to return the list of moves anyway

So far all I can do is tell if it's killable or not

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

The Self-Referential Algorithm Most people are familiar with Tupper's self-referential formula. When the formula is graphed on a calculator it magically graphs itself. Wouldn't it be interesting if we could do something similar with a programming language? Your task Write a small program that ...

Business Cat

That test case does work if the list is [16, 1] instead of [1, 16]

Step Hen

20:35

@BusinessCat uh...

that's weird

Mr. Xcoder

CMC: Given an integer, reverse its digits and get the prime factors.

Business Cat

Not really. In logic terms it's basically "There exists a sector X, such that #heads % X is 0, and either (#head / X is 1 or the hydra with #head/X+heads per turn is still killable)"

And so to see if there exists and X, it tries the first element in the list first.

And so it tries 1 on every single step

Mr. Xcoder

21 -> 12 -> [2,2,3] (or [2,3] or [[2,2],[3,1]] or whatever)

You may take it as a String

Step Hen

@Mr.Xcoder crap don't have prime factors implemented yet :(

Mr. Xcoder

@StepHen In cquents?

Step Hen

20:39

yeah

Business Cat

Gaia: vḍ

Step Hen

I'm rewriting it this weekend and adding SBCS, my stupid two byte stuff wasn't working

You'll be happy, I'm making bitwise ops 1 byters :P

Mr. Xcoder

3 bytes in Pyth: Ps_

Lynn

classy i.imgur.com/M5hF29a.png

AdmBorkBork

@Mr.Xcoder Uh, something like 150 characters in PowerShell (guessing)

That's not a CMC, lol

Mr. Xcoder

20:40

@BusinessCat Does gaia automatically convert string to ints, or is there a built-in for reversed digits

?

Business Cat

Built-in for reversed digits

Mr. Xcoder

@AdmBorkBork More in Swift

@BusinessCat Neat

Business Cat

Well, it's the same operator as reversing strings or lists

HyperNeutrino

DUḌÆE or DUḌÆF or DUḌÆf depending on the desired format

Business Cat

It just also works on numbers

Step Hen

20:41

@Mr.Xcoder it would be something like #|1:\P\rA

replace \P and \r with random unicode

AdmBorkBork

We'd need to reverse the input, then loop down from the number, checking each time if it's prime and if it's a divisor, add that to an array if so and divide out the number. Yeah, somewhere around 150 or so.

Mr. Xcoder

I see this room is active, so does anyone want to play Contact once more? (Maybe it's not ok to play twice in a day, but I'm bored and if you don't have anything better to do..)

AdmBorkBork

Might be golfable down to 140

Mr. Xcoder

~70 python or ~85 in Python

Business Cat

@Mr.Xcoder I can't right now but there's no limit to how much is played

HyperNeutrino

20:42

hm not now I'm working on Proton xD

Business Cat

@Mr.Xcoder You might also want to check out the other Puzzling game rooms

Mr. Xcoder

@HyperNeutrino I am working on Cthulhu's built-ins

HyperNeutrino

ah :P

Jordan

@Mr.Xcoder I'm down but I'm leaving here at 4:00

HyperNeutrino

for me I'm working on the parser and adding more constructs

Mr. Xcoder

20:43

@BusinessCat I should go to Puzzling.Se itself maybe

HyperNeutrino

@Jordan timezone? it's 4:43 for me.

Jordan

@HyperNeutrino CST

Or CDT

Lynn

“You should downvote people’s answers if they are irrelevant, or low-quality, or if you agree with the author on the subject of Russian StackExchange question titles.”

HyperNeutrino

ah ok.

Jordan

I dont really know if it's daylight savings time :X

Mr. Xcoder

20:44

@Jordan Not sure what 4 means. It's 15 to 12 here

Step Hen

@Lynn hey it might have been from whoever posted the other Haskell answer

Business Cat

I've gotten completely random downvotes before too

Step Hen

@Mr.Xcoder it means in 15 minutes I believe

Lynn

ah, yes, downvote your competition in order to win!

Jordan

Alaska? @Mr.Xcoder

HyperNeutrino

20:45

1 downvote isn't too irregular (though it's strange since it's not a bad answer) but more would be investigation-worthy.

Step Hen

@Jordan Romania

Mr. Xcoder

No, the other side of the globe (12 AM)

Step Hen

see his profile

@Mr.Xcoder go to bed :P

Jordan

Ooh cool

Lynn

This site is kind of a joke sometimes. But I highly doubt that this instance is random

Mr. Xcoder

20:45

@StepHen No thank you

HyperNeutrino

when did you get the downvote ¯\_(ツ)_/¯

Lynn

Especially if you look at the comments on the OP! And the edit history on the OP.

Mr. Xcoder

I always get random downvotes

Jordan

FWIW I upvoted you

Mr. Xcoder

@Jordan Who are you talking to?

Jordan

20:46

@Lynn

HyperNeutrino

It does seem suspicious to me since none of the other answers have downvotes.

Mr. Xcoder

For example, I have 3 random dv for the xkcd dumbness

AdmBorkBork

@Mr.Xcoder Sandbox post incoming

Mr. Xcoder

@AdmBorkBork Hey!

©

AdmBorkBork

lol

Mr. Xcoder

20:49

</joke>

Jordan

@Mr.Xcoder answer got copyrighted, damn

Mr. Xcoder

CMC: Create a CMC

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Factors in Common Based on a chat message Given an input number n > 999, output a list of all prime factors that the number and its reverse have in common. Note that if the factors of one number are [2, 2, 3, ...] and the other has [2, 3, ...] only one 2 should be output. Obviously a palindromi...

Step Hen

@Mr.Xcoder CMC: nth integer ending in <not zero><zero>

In other words, nth integer divisible by 10 but not by 100

ATaco

Is 0 one of these numbers..?

Step Hen

20:52

@ATaco no

Mr. Xcoder

@StepHen s/number/integer/

Jordan

CMC: Input an integer, output the integer raised to the power of each of the numbers in the integer.

EX. Input: 1234 Output: 1^2^^3^^^4

except instead of just the "^" output the number

Mr. Xcoder

@Jordan s/numbers/digits/

HyperNeutrino

@StepHen ọ⁵=1

(is the number of times it's divisible by 10 equal to 1?)

ATaco

So like (((1^2)^3)^4), to avoid arrow syntax?

Step Hen

20:54

@HyperNeutrino Jelly will never cease to amaze me

Jordan

Yes @ATaco

HyperNeutrino

@StepHen yup :3

Jordan

Pretty easy if one of the numbers in the input is 0

Step Hen

@Jordan not automatically

Mr. Xcoder

@Jordan That would be terribly ungolfy

AdmBorkBork

20:55

Boo for PowerShell not having a ^ operator.

HyperNeutrino

@Jordan DU*@/

Mr. Xcoder

@AdmBorkBork Nor does swift :)

HyperNeutrino

(Digits, reversed, and reduced by applying exponentiate backwards)

Step Hen

@HyperNeutrino there's no "apply exponentiate forwards"?

Jordan

@HyperNeutrino excuse my "noob-ness" but what language is that?

Step Hen

20:56

@Jordan Jelly

HyperNeutrino

as in lambda x, y: y ** x over lambda x, y: x ** y

Jordan

thanks

Step Hen

most likely

HyperNeutrino

Yes, it is.

I should start saying that specifically.

ATaco

@Jordan Jelly, 3 Bytes. D*/

HyperNeutrino

20:57

But usually if I don't say it, it's in Python or Jelly, and it's obvious which is which.

@ATaco That's not quite right.

Wait WHAT?

I misread the question ;_;

ATaco

;)

HyperNeutrino

The U and the @ are useless. So ATaco is right :(((((((((((((((((((((((

I was beaten at Jelly by a taco.

Mr. Xcoder

I misread too:

i=input();z=int(i)
for i in i:z**=int(i)
print(z)

HyperNeutrino

> for i in i

ATaco

Tacos are surprisingly good with dessert.

HyperNeutrino

20:58

@ATaco s/'//

Mr. Xcoder

@HyperNeutrino I know

HyperNeutrino

ಠ_ಠ

Jordan

Dang, 3 bytes

Step Hen

@HyperNeutrino it's perfectly valid

Jordan

Not sure if that tells me my CMC skills are bad or that Taco's are great

Step Hen

20:59

@Jordan it means that Jelly can do a lot with a little

HyperNeutrino

@StepHen I know but still

ATaco

Nah, just right tool for the job.

Mr. Xcoder

print(eval("**".join(input())))

HyperNeutrino

nice

but that's wrong.

AdmBorkBork

@ATaco I'm not sure if you're meaning a hot arid climate, or a sweet treat after a meal.

Mr. Xcoder

20:59

@HyperNeutrino What, why?

Jordan

@StepHen That hints to me that Jelly has a LOT of commands in it which scares me haha

HyperNeutrino

Python's exponentiation is RTL just like Proton's, but this challenge requires LTR.

Mr. Xcoder

Did I remisread?

HyperNeutrino

@Jordan github.com/DennisMitchell/jelly/wiki/Atoms

Transcript for