The Nineteenth Byte

Surround a string with "friendliness pellets" code-golf Input a String and surround it with a ellipse of alternating "friendliness pellets"(0) Idea originally from Lyxal. Challenge Given a single line String of length lesser than your console's width, print the string with an ellipse of alternat...

Lyxal

9:08 AM

@Adám is there a short way to print all the stations on the London Underground Network?

Because that'd be epic

Adám

@Lyxal Is 44 bytes short enough?

Lyxal

@Adám that is well and truly the most amazing thing I've seen all day

Thanks for that!

Adám

Oh well, my code chops any trailing ) off. ¯\_(⍨)_/¯

Lyxal

Paddington(N: It seems to keep (s

Still, it'll greatly help with my games of Mornington Crescent

user435118

Hi. I’d like to explore Code Golf and this site a bit. What is the best language to learn and where can I get started?

Adám

9:21 AM

@Daniil Do you already know any programming language?

user435118

@Adám I know a few but I don’t think they are good for Code Golf. I know Python 3, JavaScript and a bit of C#

HighlyRadioactive

@Daniil Python 3 is very good for golfing

although I prefer Python 2

New Bounties With No Deadlines

A: List of bounties with no deadline

50 rep for a quine in MAWP I'm very interested in seeing how a quine could be made in this language. I will award 50 rep (may be increased later on) to anybody who posts a valid quine submission here in the language MAWP. Any version may be used.nLink to online interpreter here.

HighlyRadioactive

It's probably the second golfiest commonly-used language after Perl

(I mean, APL and J are not too common)

user435118

Ok, is there any tips for golfing with Python? Anywhere I can practice?

Adám

9:27 AM

276

Q: Tips for golfing in Python

What general tips do you have for golfing in Python? I'm looking for ideas which can be applied to code-golf problems and which are also at least somewhat specific to Python (e.g. "remove comments" is not an answer). Please post one tip per answer.

HighlyRadioactive

One thing to note is don't be frustrated when others beat your answer in a different language

Adám

@Daniil For practising, just try to solve problems on the site, even if they already have solutions, even in Python.

@Lyxal 50 bytes for a more robust version.

@Daniil JavaScript can also be quite good for golfing, and occasionally .NET has a built-in that beats all other approaches.

2 hours later…

Raghu Ranganathan

11:37 AM

hey

another new person

1 hour later…

Raghu Ranganathan

12:40 PM

I finally golfed in an esolang

It's a bit hard to wrap your head around

3 hours later…

SE - stop firing the good guys

3:24 PM

Q: Interpret ><> (Fish)

While ><> is not a popular language, it can be good for golfing and has been used on this website. It was inspired by Befunge and has some similarities in its instructions. Required Commands: > < ^ v Changes the direction of the instruction pointer (right, left, up, down) / \ | _ # Mi...

code-golf interpreter stack

It's almost a decade old, but I'm now convinced ><> can be implemented in ><> with at most a few weeks of effort.

Writing the interpreter like an old-style debuger, one may simulate the instruction pointer, effectively sandboxing ><> execution, making it possible to do enough memory protection to accommodate the interpreter itself.

my pronoun is monicareinstate

3:58 PM

the way I'd approach it: find a tool that can compile a ><> interpreter to brainfuck and the problem is reduced to interpreting brainfuck in ><>.

caird coinheringaahing

4:14 PM

Any feedback on this challenge? Any glaring issues?

7 hours later…

New Main Posts

11:23 PM

Q: Find the maximum flow

Given a directed network, with a single source and a single sink, it is possible to find the maximum flow through this network, from source to sink. For example, take the below network, \$G\$: Here, the source is node 0 and the sink 5. We can see, from the minimum cut-maximum flow theorem, that...

code-golf math graph-theory

New Main Posts

11:48 PM

Q: Maximum cap set in ASPIF (clasp grounded input format)

Write an ASP program to find a maximum cap set (https://en.wikipedia.org/wiki/Cap_set) for n dimensions. Winner generates an instance for maximal dimensions that grounds in less than a minute on your computer (I don't think processor speed differences will matter for much here, but feel free to r...