The Nineteenth Byte

12:01 AM

I wonder if I should put C++ on my resume, given I don't know it well now but have three months to actually figure it out before I'd be tested on it in an interview.

I'm applying for a summer internship that asks for JS, Python, Java, or C++ and I have 3.5 out of those 4 covered.

Oddly enough, it's a Microsoft internship, and they ask for Java and not C#.

H.PWiz

I wouldn't put C++ then. It is an or, and you'll look like a real tit if you don't learn it for any reason

Christopher

i answered phone and they thought i was my dad

Pavel

Happens

Christopher

I panicked and didn't correct them

Pavel

Good job

Leaky Nun

12:14 AM

is my cmc incomprehensible?

DJMcMayhem

Maybe

I can't understand it

H.PWiz

@LeakyNun Nope. Haskell 46 bytes: TIO

dylnan

I had to read it a few times to understand it. It is well formed but maybe could be worded more clearly

By well formed I mean it is possible to understand what you mean

H.PWiz

^^^ is slightly invalid

Leaky Nun

@H.PWiz lol, was about to point out

(to everyone) ping me if you don't understand the CMC

H.PWiz

12:19 AM

@LeakyNun Can we output 1 as 0.99999 for example?

Leaky Nun

@H.PWiz yes

but you can't output 70.0303... as 69.(10)2(10)2... :P

tio.run/##y0gszk7Nyfn/…

DJMcMayhem

@LeakyNun I think I understand it, but I don't understand outputs the n-th digit when given n, and given n,

Leaky Nun

so f(0)=23, f(1) = 1, f(2) = 2, f(3) = 1, f(4) = 2, etc

DJMcMayhem

Is the second n the length of the digits?

Leaky Nun

f represents the real number 23.121212...

so p(f,0) = 69, p(f,1) = 3, p(f,2) = 6, etc

p(f,_) represents f*3

DJMcMayhem

12:21 AM

I get that, I'm just not sure what n we're given

Leaky Nun

p(f,n) is the n-th digit of "f*3"

DJMcMayhem

Ah, I get it now

Leaky Nun

sorry, will reply less frequently from now

dylnan

If f represented the number 1.997 would p(f,1) be 9?

Leaky Nun

1.997 * 3 = 5.991

yes

Anonymous

12:29 AM

So this CMC requires laziness... Definitely a job for Haskell

H.PWiz

Not necessarily

Anonymous

@H.PWiz Well, not exactly requires, but it's probably the least painful way to solve it :P Working with infinite lists is hard

Leaky Nun

hint: there's more to the cmc than the surface

Christopher

wait who said "no onë sanë" i wasn't ready to talk yet

@NieDzejkob you called?

Why do you people only talk when I am not talking :|||

Anonymous

@Christopher Allow me to introduce you to a little topic called "time zones" :P

Christopher

12:36 AM

@Mego Wait you guys have timezones? Imma have to talk to geobits about fixing them so they all are in EST

@DJMcMayhem i sandboxed Text to BrainFlak

I cannot decide on what to say to express my frustration so I am saying this instead

Leaky Nun

@H.PWiz are you fixing it :P

H.PWiz

I'm looking at doing it APL. So don't hold your breath

Leaky Nun

ok

New Main Posts

0

Q: Human-Readable Counting

Guidelines Task This is a tricky one. You need to take any positive integer up to four billion and turn it in to plain English. You do not need any capitalisation or punctuation, but you need to include and's where necessary. You can assume that you will always get a valid input. Examples 1...

code-golf

DJMcMayhem

@Christopher I saw that. It looks good, but you'll need to specify what texts it is being scored on

Christopher

12:48 AM

Yeah

Οurous

I'm not sure about the general utility of a complex-conjugate builtin

Ørjan Johansen

@LeakyNun I believe this is impossible for some inputs, like 0.3333333...

Leaky Nun

@ØrjanJohansen you can output either 1.000... or 0.999...

Adám

@Οurous Like APL's + ?

Leaky Nun

hi @Adám

Adám

12:51 AM

@LeakyNun Hi Kenny.

Ørjan Johansen

@LeakyNun No you can't, because you will never know that it won't suddenly get a 2 or 4 in there.

Leaky Nun

@ØrjanJohansen bingo

19 mins ago, by Leaky Nun

hint: there's more to the cmc than the surface

Οurous

@Adám I'm going to assume so, but I mean in the context of a 2d language where I can only have so many builtins.

Leaky Nun

you win my respect :P

Ørjan Johansen

Yay!

Leaky Nun

12:52 AM

this is equivalent to solving the halting problem

H.PWiz

Oh ..., shame I didn't see that :(

Οurous

@Adám Also is that just a plus sign?

Adám

@Οurous Yes. Monadic - negates both real and imaginary part. + negates just the imaginary part.

Anonymous

@LeakyNun In theory, yes. In practice, not necessarily. In a language with fixed-width (or otherwise limited) integers, the value represented by f is guaranteed to have a finite number of decimal places :P

Pavel

Since Haskell doesn't have for loops, what's the best way to get a list of tuples like tio.run/##y0osS9TNL0jNy0rJ/v@/… ?

Potato44

12:58 AM

@Pavel You linked to Hello world in java

Leaky Nun

@Mego not really

I can output 3 in a loop

Pavel

@Potato44 oops

Basically, nested for loops

Anonymous

@LeakyNun Sure, but f(INT_MAX+1) isn't a valid function call, so it's impossible to output more digits than the maximum value of your data type.

Pavel

Like, one for loop is just using an array range

Potato44

@Pavel depends on what you are doing with the for loop, like a foreach loop?

Pavel

1:00 AM

@Potato44 Just need a list of tuples (1, 1), (1, 2), (1, 3), (2, 1), (2, 2)...

Anonymous

@Pavel [(i,j)|i<-[0..4],j<-[0..5]]

Pavel

Lovely

Οurous

@Adám That irritated me at first, but it the longer I think about it the more I like it. I think I'll re-purpose z for conjugate and Z for "is a finite number". Thanks.

Adám

Jan 13 at 17:31, by Mego

When in doubt, steal glyphs from APL :P

Anonymous

Or liftM2(,)[0..4][0..5]

Ørjan Johansen

1:02 AM

Or (,)<$>[0..4]<*>[0..5].

Οurous

Heh. APL is actually a lot like that for me: Cycles through "That's dumb" -> "I wonder why they would do that" -> "Oh I get it" -> "Hey that's actually cool"

4

Pavel

@ØrjanJohansen I understood Mego's two, that one looks like black magic.

Anonymous

@Pavel It's identical to my second, but spelled differently

Pavel

I've never seen triangle brackets in Haskell

Anonymous

<$> is inline fmap, and <*> is inline ap

Leaky Nun

1:05 AM

@Mego you do have a point

but I work with Type 2 computability :P

H.PWiz

Well, it's closer to liftA2(,)[0..4][0..5]

Anonymous

@H.PWiz Sure, but with lists, they're functionally identical

Potato44

@Mego inline fmap, not mapM

Anonymous

@Potato44 Derp

Ørjan Johansen

The ...<$>...<*>... notation is equivalent to liftA... but (1) needs no import (2) works regardless of number of arguments.

H.PWiz

1:07 AM

It works really nicely with Parsers

Anonymous

If you want even cleaner code: sequence[a,b]

Pavel

I use Haskell so I can apply the functional patterns i learn to System.Linq and bring my C# programs closer and closer to being just one obscenely long statement.

Anonymous

@Pavel Psh, nothing obscene about long statements. Pointfree is the glorious standard which we all strive to achieve.

Ørjan Johansen

Also, the triangle brackets are just convention, <$> and <*> are operator names.

Leaky Nun

btw for a more feasible CMC: multiply by 2 instead

(this is feasible)

Ørjan Johansen

1:09 AM

Or if you mean why Haskell doesn't use <....> as general bracketing, that's also because < and > are operator chars, not delimiters.

Pavel

@Mego Not always pointfree, it's lambdas all the way down.

Anonymous

@Pavel Then make it pointfree :P

Pavel

@Mego No operator functions. How do you make n=>n+3 pointfree?

H.PWiz

With currying

Pavel

In Haskell, (+)3, in C#, idk.

Anonymous

1:10 AM

@H.PWiz Exactly

Pavel

@H.PWiz I'm still left with named arguments

Anonymous

var Plus = a=>a=>a+b

Anonymous

Your constructs to write pointfree code don't have to themselves be pointfree

totallyhuman

@Pavel I think most haskellers would prefer (3+)

Anonymous

That allowance is given for languages that are not designed with the light of pointfree in mind

H.PWiz

1:12 AM

I'd prefer (+3)

Anonymous

@H.PWiz Yeah I always write <op><arg> and not <arg><op> unless <op> isn't commutative

Pavel

F# should be my favorite language, because I love the capability of the .NET platform, and I love the functional aspect that System.Linq gives, but for some reason it isn't.

Leaky Nun

@ØrjanJohansen link?

Ørjan Johansen

Never mind, that's wrong.

H.PWiz

Easy CMC: Let's just multiply by 10 instead

Pavel

1:17 AM

It's everything I like about C# with some extras thrown in, but I just can't get into it.

Anonymous

@Pavel To me, F# is almost there. The lack of an arbitrary-width integer type in .NET frustrates me

Pavel

@Mego There's a BigInteger

Anonymous

...I need to use .NET more

Pavel

Also, the decimal type goes up to 79,228,162,514,264,337,593,543,950,335.

totallyhuman

...octillion? is that the word? Indeed it is

Pavel

1:24 AM

If you need more than that you might be doing it wrong

quartata

@MDXF What encoding does cubically output in?

H.PWiz

@LeakyNun APL 24 bytes

quartata

one of your cops outputs characters in it but I can't tell if it's proper without knowing the encoding

Leaky Nun

@H.PWiz nice

H.PWiz

Although, I think some of it is redundant

Adám

1:29 AM

@H.PWiz If the operand will always consist of scalar functions, then the ¨ is unnecessary.

H.PWiz

Yes, but my examples were harder to write as scalar functions

totallyhuman

CMC: what types of loops does your chosen language have?

Pavel

@totallyhuman C#: for, foreach, while, label/goto, recursion

Adám

@totallyhuman For-In-EndFor, For-InEach-EndFor, While-EndWhile, While-Until, Repeat-EndRepeat, Repeat-Until, ApplyToEach, ApplyNTimes, ApplyUntil, GoToLine, Label, GoToLabel, Recursion.

Ørjan Johansen

.oO( Define "loops" )

(Also "have")

Pavel

1:39 AM

F# is the same as C#, but will tail-call optimization

Ørjan Johansen

Recursion, mapM/traverse, mapM_, sequence, list comprehensions, do expressions (in the list monad).

Pavel

@ØrjanJohansen I'd argue that most of those aren't loops but list transformations.

Adám

Ah yes, I forgot, mapping, reduction, cumulative reduction.

Ørjan Johansen

Well my argument is that in Haskell, lists are loops in many respects.

Especially after GHC gets done fusing them.

Pavel

Naturally C/F# have a collection of standard mapping/reducing/whatnot builtins

Ørjan Johansen

1:44 AM

Which is one reason why there are so few "real" loop constructions.

Pavel

Also IEnumerable<T>.ForEach

Οurous

@totallyhuman Recursion, various comprehensions / state folding / iterative applications / (etc.). If you count inline intermediate language, you can add everything you find in your standard assembler language (goto / jmp / jmpz, etc.).

Ørjan Johansen

(Without import libraries.)

Οurous

(yes that means you can goto label in a functional language)

totallyhuman

(lol I'm totally not stealing ideas for my golflang)

Pavel

1:48 AM

@Οurous would that break everything though

Because of lazy evaluation, you don't know the order that stuff will execute in

totallyhuman

so far I've thought of infinite, foreach, first n, while, until

Οurous

@Pavel Actually, you do, by the time you're in the IL. You can only jump inside the same IL section, so it works. It's really bad, but it works.

quartata

we need to work together to crack this

I've tried all of his languages and almost every esolang on TIO

it has to be something obvious

H.PWiz

@quartata Got it

DJMcMayhem

@Pavel V, recursion.

quartata

1:56 AM

@H.PWiz how what is it

H.PWiz

Cubically -6

DJMcMayhem

I guess it also sorta has a for? Not really

quartata

It's not cubically

DJMcMayhem

More like a do N times

quartata

Unless it's using a weird encoding

H.PWiz

1:57 AM

-6 flag

Anonymous

@H.PWiz Gah. People need to remember the "include any flags you're using" rule!

quartata

....

you're right

totallyhuman

That was literally the first thing I tried

quartata

I didn't try any flags because it wasn't in the bytecount

@MDXF you have to include command line options in cops

totallyhuman

43 minutes left ha

quartata

1:59 AM

@totallyhuman literally tried it twice because I thought maybe a cosmic ray hit it the first time

@totallyhuman doesn't matter, would have been ruled invalid

Anonymous

It's frustrating that a decent number of the cops that went uncracked for a while were because they didn't include the flags like they were supposed to

totallyhuman

yeah plus I could've crossed the snippet's graph's limit again

:P

quartata

All right that leaves these two:

2

A: The Programming Language Quiz, Mark II - Cops

???, 8 bytes One last crack at a short one. gD[Lxe]O Outputs as raw

2

A: The Programming Language Quiz, Mark II - Cops

???, 11 bytes JuvlikaJoEs Outputs decimal with newline after every number.

I think I know the first one

one sec

second one could be almost anything...

Οurous

2:15 AM

@quartata Except a non-obscure, general-purpose language.

quartata

2:26 AM

hrm OK the first wasn't what I thought

totallyhuman

2:56 AM

hmm

somebody could totally do codesins

like cinemasins

or even golfsins

ATaco

3:17 AM

The second one almost looks like Tomato.

quartata

4:00 AM

I don't think that has an esolangs page

Pavel

4:24 AM

Or a working implementation

tfbninja

5:25 AM

@mudkip201 I was doing this challenge and I immediately thought of the one byte answer, but it didn't seem to work correctly. Isn't input implicitly put on the stack, therefore summing should sum the input?

DJMcMayhem

@tfbninja I don't know pyt, but I'm pretty sure it's just an input format issue: Try it online!

totallyhuman

CMP: should iterating over a stack be destructive?

DLosc

5:47 AM

Yes: by definition, a stack only lets you access the top item, so iterating over all items requires popping each one to get to the one beneath it. If you want non-destructive iteration, you've got a deque or a linked list or something else.

Or, you can push the popped values onto another stack and restore them later, in which case it's not "destructive" per se.

Potato44

7:43 AM

github.com/potato4444/brainfuck

Just had a bit of fun implementing a brainfuck interpreter that supports arbitrary cell sizes

New Main Posts

8:55 AM

0

Q: DNA to RNA Transcription

Guidelines Task Given a DNA strand, return its RNA complement (per RNA transcription). Both DNA and RNA strands are a sequence of nucleotides. The four nucleotides found in DNA are adenine (A), cytosine (C), guanine (G) and thymine (T). The four nucleotides found in RNA are adenine (A), cyto...

code-golf string