The Nineteenth Byte

@DLosc Current consensus on meta is that submissions to constant output challenges do not need to use a programming language in our sense of the word. That's entirely nonsensical in my opinion, but it is what it is.

DLosc

@Dennis Aha. See, this is why I asked in chat rather than just commenting/editing. ;)

5:08 AM

@NewMainPosts Anyone know if that's a dupe of anything? Searchability seems a bit tricky

@Sp3000 Good luck finding a dupe when nobody knows what exactly the challenge is.

Well the way I see it is, say, if you're standing at (0, 0) then you can't see (2, 2) since (1, 1) is in the way (so answers will probably have to use gcd I'm guessing)

@Sp3000 Not quite... if you're standing at (0,0), there's a building at (1,1), but there isn't any building at (2,2); you can't see the building at (3,3) because it's hidden by (1,1)... and also there are buildings at (1,2) and (2,1)

Why wouldn't there be a building at (2, 2)?

Same reason there's no building at (0,0)... you're not on the edge of a tile

5:18 AM

I think we're probably thinking of the problem differently - the way I'm thinking of it is that there's a building at every lattice point, and (0, 0) is the exception just because that's where you're standing

Eamon Olive

5:42 AM

@DJMcMayhem Looks nice! I had a question or two that I asked, but it looks really good it should open up the possibilities for brain-flak as a whole. It does look like we are in for the mother of all merge conflicts though.

@DJMcMayhem So in ascii-mode you input and output in ascii?

there's no numin charout?

Hm, visible buildings might be a flag challenge in disguise.

jelly.tryitonline.net/…

@Dennis How the hell is using ŒR longer

Because of halving and absolute value.

I know, that isn't a question

@Dennis Automatic flooring \o/

5:51 AM

Right, ŒR floors.

@LeakyNun Declaring m, i and j globally saves a few bytes.

@Dennis thanks

@Dennis How?

Making your submission a function would probably a lot more though.

@LeakyNun m,j,i;main(n){scanf("%d",&n);for(m=n/2,i=-m;i<=m;...

I don't like taking in argument and then printing to stdout

@Dennis I'm failing to see how that saves bytes

Wait, I thought using un-initialized variables is UB

Global variables default to 0.

Weird

5:58 AM

Variables in global are initialized to 0; it's automatic variables that are undefined

Why is C named C?

Because it is based on B.

Don't recall... probably because it followed B/BCPL?

Yet people seem to have forgotten B entirely...

Well, almost entirely

6:03 AM

@EamonOlive Hahaha, yeah not looking forward to that...

@LeakyNun No, there is not right now. Do you think that would be a useful feature?

@DJMcMayhem Yes, e.g. to do the challenge in main

Which one?

2

Q: Visible Buildings

This puzzle is derived from CodinGame SamSi's "Heart of the City" puzzle. Description You decide to take a walk in an n * n tile city and go to the center tile. All of the buildings are infinitely small, but you have super vision and can see everything close up and far away. Constraints n is ...

code-golf math ascii-art

Why not just add ([((((()()()){}){}){}){}]) to the beginning?

@DJMcMayhem ??

6:06 AM

-48

What about two-digit?

I guess you'd need to pop first

I'd need to add a long wrapper

@LeakyNun Oh, that's true.

@LeakyNun C was everything B was and more, and it was created only a few years later.

6:06 AM

@Dennis I see

@LeakyNun OK, I might add that later, but I'm brain-flakked out for now. I don't want to work on it anymore today.

It was C that introduced types, right?

@DJMcMayhem also

Yes?

@HWalters I think B started having types before C was created.

6:11 AM

Wikipedia seems to agree with me, unless potentially we split hairs on pre-type-int vs pre-type-char

Oh... then there's "New B"... another hair to split... which introduced types... got it

6:37 AM

@Dennis Did you write TIO's BF interpreter yourself?

@Sp3000 Yes. I tried finding one that did exactly what I wanted to, failed, and quickly hacked a bf-to-C transpiler in Bash.