The Nineteenth Byte

Erik the Outgolfer

14:00

@Riker ah of course why I didn't think of that

Lembik

hi all

Okx

Is there a meta post on 'when answers should be downvoted'?

Lembik

I have an idea for a challenge but I need some help

Okx

Sandbox?

Kritixi Lithos

@LeakyNun but what would count as a "snippet" in Vim?

Leaky Nun

14:02

@KritixiLithos no idea

Lembik

@Okx I could make a start there.. could point

good point

Kritixi Lithos

I wonder if I could combine vimscript and vim into one submission. If that is valid, I might be able to get one more number easily

Leaky Nun

-17

Q: Downvoting needs to change

As shown by a recent challenge, once a few people have downvoted a question (say, three or four) everyone else thinks that they should downvote too leading to incredibly low scores. I think we need a reform on how we downvote and/or what we downvote on. This will stop people from becoming dishea...

Okx

'consider leaving comments when downvoting'

totallyhuman

14:24

D: it's -17

Wheat Wizard

Can any python expert find a way to make 14 for this answer?

Lembik

so... what's the best way to make a good challenge from codegolf.meta.stackexchange.com/a/12706/9206 ?

I would like to avoid running code on my computer as I only have a windows laptop so I assume I won't even be able to run most code

Kritixi Lithos

@Lembik maybe you should define what a Hamming distance is in your challenge

Lembik

@KritixiLithos will do

Leaky Nun

@Lembik you don't need to run the code on your computer if it is code-golf

Lembik

14:31

@LeakyNun it's not very interesting as code-golf

it's interesting if you have to work out a quick way to solve it

Leaky Nun

so you intend to make it fastest-code?

Lembik

@LeakyNun well that would be good but can you do that without volunteering to run everyone's code?

or could it be code-challenge where the person who does it for the highest n wins?

Leaky Nun

@Lembik you can redirect every entry to TIO

Okx

If it's runnable on TIO, that has a timer

Lembik

is that allowed? Seems it would potentially kill TIO

whose PC does it run on?

Okx

14:33

A dedicated machine

Leaky Nun

@Lembik it won't kill TIO

Lembik

what happens if two people do that at the same time?

Leaky Nun

there's no problem

Lembik

won't the timings be wrong??

or is it cpu time that is timed?

Okx

there's 3 timers

Leaky Nun

14:34

Please ask @Dennis for the details

Lembik

I like the idea though.. could you help me do this?

I need to offer some nice way for answers to do this

Leaky Nun

@Lembik you just need to tell them to include a TIO link

Lembik

has this ever been done before?

for fastest-code questions

Leaky Nun

I've no idea

Lembik

maybe it makes a good meta question

Arjun

14:38

Hey vsauce Michael here

orlp

@Lembik you can just state it instead of pinging me and waiting until we're both here :P

Lembik

@orlp :) I made a sandbox question about it in the meantime

@orlp codegolf.meta.stackexchange.com/questions/2140/…

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Compute approximate correlations Consider a binary string S of length n. Indexing from 1, we can compute the Hamming distances between S[1..i+1] and S[n-i..n] for all i in order from 0 to n-1. The Hamming distance between two strings of equal length is the number of positions at which the co...

TuxCopter

CMC: Find an unicode ligature with the most characters in it

Leaky Nun

@TuxCopter the bismillah one?

TuxCopter

14:42

This? ﷽

Leaky Nun

﷽ | arabic ligature bismillah ar-rahman ar-raheem (U+FDFD)

TuxCopter

Ok lol you win

orlp

@Lembik so the pairwise hamming distances between the prefixes and suffixes of a binary string of length n?

Lembik

@orlp yep

Dennis

@Lembik Unfortunately, I don't think this is a very reliable way of timing code. Even if counting CPU time rather than wall time, two processes running at the same time can affect, e.g., speed of memory access, especially if the data should already be in the CPU's cache. Finally, TIO currently runs user-supplied code on two different "arenas", and while they have identical specs, one is consistently slower than the other, by a rather large margin.

Lembik

14:43

@orlp but capped at 1

@Dennis I wrote codegolf.meta.stackexchange.com/q/12707/9206

Luc H

guys, is it according to the stackexchange rules, allowed to downvote a question because you just don't like it?

orlp

@Lembik capped at 1?

Lembik

@orlp it is min(1, Hamming distance)

Okx

@Dennis Why's one consistently slower?

orlp

ah

Lembik

14:45

so [0, 2, 0, 4, 0] became [0, 1, 0, 1, 0]

orlp

so basically

'how many prefixes/suffixes are pairwise equal'

Lembik

hmm no.. I must have a bug

2 secs

orlp

@Lembik there's no reason to introduce hamming distance here

Lembik

it is how many prefixes/suffixes have at most 1 difference

0 doesn't mean equal

I need to fix that

orlp

min(1, hammingdist(a, b)) <=> a == b

@Lembik hammingdist(a, b) <= 1

so 0, 1 becomes 1

everything else 0

Dennis

14:47

@LucH I'd say that's the most common reason. As long as it's actually about the question (not, e.g., who posted it), I don't see any issues.

Lembik

right...I have a bug

let me fix it

Dennis

@Okx I wish I knew. Gremlins, probably.

Okx

Gremlins?

Erik the Outgolfer

~~what Dennis blames his sloppy coding to~~ the creatures that often randomly mess up with TIO

Luc H

@Dennis i thought you could only downvote because it was badly formatted or impossible etc, not just because you personally find it too easy while others do a great job at it.

orlp

14:49

@Lembik if a, b are the prefixes / suffixes as i-bit integers

Lembik

@orlp ok I have hopefully fixed it. It was completely wrong before

thanks for helping me spot that

orlp

then your expression is !((a ^ b) & ((a^b) - 1))

a^b is bitwise differences

x&(x-1) is 0 if x has exactly 0 or 1 bit set, otherwise positive

then we invert that with !

Lembik

@Dennis if you have any suggestions for how to run challenges such as my sandboxed one they are gratefully received

New Meta Posts

0

Q: Is TIO acceptable for fastest-code questions?

I like to ask fastest-code questions. However, I don't want to run everyone's code on my PC, partly because I only have access to a slow Windows laptop at the moment and I can't imagine I could even run most code in most languages. Is it acceptable to ask people to include a TIO link in their...

discussion

Lembik

@orlp is this for my fixed problem?

orlp

14:52

yes

Lembik

great :)

orlp

the i prefix of a word w is w & ((1 << i) - 1)

the ith suffix is

(w >> (n-i)) & ((1 << i) - 1)

Dennis

@LucH I'd normally cite the tooltip of the voting buttons, but those were made for Q&A sites, and PPCG isn't exactly a Q&A site. I base my question upvotes on whether I think that the challenge adds something to PPCG. I don't like questions that don't, so if I vote based of whether I like the challenge is debatable.

Leaky Nun

@orlp is the & here necessary?

I'm writing a similar implementation also

orlp

@LeakyNun strictly speaking, no

Leaky Nun

14:55

@Lembik here is my implementation:

def f(n):
	res = set()
	for i in range(2**(n-1)): #WLOG fix the highest bit
		res |= {tuple([i>>(n-j) != (i&((1<<j)-1)) for j in range(n)])}
	return len(res)


for n in range(1,21):
	print(f(n))

TIO link

Output:

orlp

@LeakyNun the != was wrong

Leaky Nun

It differs from your provided solution significantly...

@orlp why?

orlp

he edited his question

he wants pairs of prefixes/suffixes that have at most hamming distance 1

Leaky Nun

oh...

Lembik

@LeakyNun yes sorry.. the description was screwed up before

Leaky Nun

14:59

def is_power_of_2(n):
	return n&(n-1) == 0

def is_zero_or_power_of_2(n):
	if n==0:
		return True
	return is_power_of_2(n)

def f(n):
	res = set()
	for i in range(2**(n-1)): #WLOG fix the highest bit
		res |= {tuple([is_zero_or_power_of_2((i>>(n-j)) ^ (i&((1<<j)-1))) for j in range(n)])}
	return len(res)


for n in range(1,21):
	print(f(n))

TIO link

Real time: 15.647 s
User time: 15.483 s
Sys. time: 0.027 s

Lembik

good :)

Leaky Nun

Now the answers match

Okx

You might want to make a separate chatroom for all of this, it's getting a bit spammy

Leaky Nun

@Okx there isn't any other on-going discussions ATM

Okx

Never said you had to

orlp

15:00

@LeakyNun is_zero_or_power_of_2 is the same without the if statement

0 & -1 == 0

Lembik

@LeakyNun maybe just give the link instead of all the code

Leaky Nun

@orlp wow

Lembik

but thanks for reproducing it!

orlp

I don't understand the fixing the highest bit part

Leaky Nun

@orlp well, S and ~S produce the same results for any bitstring S

orlp

15:02

oh you fix it to zero

I was looking for the code to fix it to one haha

Lembik

:)

Erik the Outgolfer

@Okx no way to assign to variables in Neim it seems?

Okx

Planned feature.

Erik the Outgolfer

ok

wow there are really 1-byte equivalents for 0-33? o_O

orlp

>>> def L(n):
...     V = set()
...     for w in range(2**(n-1)): # Highest bit is zero.
...         v = []
...         for i in range(1, n+1):
...             pre = w & ((1 << i) - 1)
...             suf = w >> (n-i)
...             v.append((pre ^ suf) & ((pre ^ suf) - 1) == 0)
...         V.add(tuple(v))
...     return V

>>> [len(L(n)) for n in range(1, 20)]
[1, 1, 2, 4, 6, 8, 14, 18, 27, 36, 52, 65, 93, 113, 150, 188, 241, 279, 377]

Leaky Nun

15:04

1-second improvement by not checking j=0 and j=1

Okx

@EriktheOutgolfer One of the first features of Neim, and the first time it's been used :P

Leaky Nun

@orlp for i in range(2, n)?

orlp

@LeakyNun yeah you could do that

I wasn't going for speed

Kritixi Lithos

fastest-code seems interesting

orlp

@LeakyNun I think you need n+1 though

Erik the Outgolfer

15:05

@Okx it's even more than CJam! (CJam has 0-20)

Leaky Nun

now, instead of storing as tuple, we store as another bitstring

@orlp the results are the same

orlp

@LeakyNun that could be luck

Lembik

my question wants to be fastest-code

orlp

oh no it's not luck, the full string is always equal to itself

Okx

@EriktheOutgolfer Breaking records here :D

Lembik

15:05

@KritixiLithos thanks :)

totallyhuman

:o is your question sentient?

Erik the Outgolfer

@Okx and how do you make a string? like, at least push codepoints to stack?

Okx

@EriktheOutgolfer You don't.

totallyhuman

don't tell me what to do

orlp

@LeakyNun we can skip 2 as well, range(3, n)

Leaky Nun

15:08

oh no, storing as bitstring takes 2 more seconds

@orlp because 01 and 10 has a hamming distance 1?

orlp

@LeakyNun always at most 1

@LeakyNun how do you see the time?

Leaky Nun

@orlp for example, 2?

@orlp debug

orlp

@LeakyNun actually now I'm not so sure anymore

it just seemed from my tests it's always the same

Kritixi Lithos

@LeakyNun the time seems to vary quite a bit, when I ran it now it says ~12 seconds instead of ~15

Leaky Nun

@KritixiLithos indeed

orlp

15:12

@LeakyNun oh no, I see my confusion

i = n-1 always seems to have more than 1 hamming distance

Leaky Nun

except for the all-zero bitstring

orlp

you'd think

oh no

I'm really silly

never mind =/

Leaky Nun

what? except for the all-zero bitstring, i=n-1 always returns false.

that's a nice observation. I don't get why you call yourself silly for that.

orlp

because that wasn't my observation >.<

Leaky Nun

whose observation was that?

orlp

15:17

@LeakyNun I also don't necessarily think that's true

@LeakyNun yours, I had a simple bug in my code

Leaky Nun

@orlp mine was a typo. I intended it to mean j=n.

@orlp you're right. It only works if there are 2 blocks of contiguous letters

e.g. 000011111

Dennis

@Emigna @PhiNotPi @WheatWizard Please don't cast regular delete votes on spam. Deleting a post via spam flags replaces the actual post with a stub, locks it, and puts the poster's IP on a network-wide naughty list, thus preventing them from using the same IP to post more than a couple of spam posts.

Emigna

OK

Wheat Wizard

I wanted to flag but I can't seem to flag from the review queue

Kritixi Lithos

@Dennis I don't see the problem

Wheat Wizard

15:23

Wait I think I'm thinking of something else, I don't see the post in the review queue.

@Dennis Whats the post in question?

orlp

@LeakyNun no need to do all mask arithmetic every iteration

>>> def L(n):
...     V = set()
...     for w in range(2**(n-1)): # Highest bit is zero.
...         r = 0
...         suf = w; premask = (1<<n) - 1
...         for i in range(n-2):
...             premask >>= 1
...             suf >>= 1
...             r <<= 1
...             pre = w & premask
...             r |= ((pre ^ suf) & ((pre ^ suf) - 1) == 0)
...         V.add(r)
...     return V

Leaky Nun

right.

Dennis

@WheatWizard codegolf.stackexchange.com/a/124359/12012

@KritixiLithos How so?

New Main Posts

0

Q: Bruteforcing a geo coordinate hash

i'm posting this because of a question in a german python forum and i'm curios on how to perform even better. For non german speaking stackoverflow users: The question was about bruteforcing a geo coordinate from a SHA384 hash with and without parallelizing with concurrent.futures in Python 3 The...

tips fastest-code

Wheat Wizard

Hm, I thought I reviewed that. I guess I just saw it. I'll flag it next time.

Kritixi Lithos

15:25

@Dennis so what is the difference between just flagging the post and deleting it?

Dennis

@WheatWizard You did review it. Does it now show up here?

Leaky Nun

@orlp look, we need new innovations. Our current "optimizations" don't really speed up the code.

Wheat Wizard

Oh that wasn't there before.

Kritixi Lithos

I don't see the downside to deletion

Lembik

@Dennis It seems that it's very hard to run a fastest-code competition currently unless you have linux ...

orlp

15:27

@LeakyNun yeah I know I'm just messing around

Dennis

@KritixiLithos I think I'm misunderstanding your question, because I think I answered it before you asked.

orlp

@Lembik then why don't you get linux?

Lembik

@orlp well :) For the next few months I am restricted to a work windows machine

then back to linux!

orlp

@Lembik you can install a virtual machine

Lembik

@orlp won't that screw up timings too?

orlp

15:28

not that much

Lembik

or maybe I should learn how to run everyone's code in Windows

Kritixi Lithos

@Dennis Ooh, I think I understand your point now. I thought "Deleting a post via spam flags" meant deleting without flags

@LeakyNun So why is it for i in range(2**(n-1)) instead of 2**n?

Leaky Nun

@KritixiLithos we fix the highest bit.

Kritixi Lithos

so you don't calculate when the highest bit is 1?

Leaky Nun

correct.

Kritixi Lithos

15:36

why?

Leaky Nun

@orlp I'm thinking about reflecting S, but I don't really know how to implement it speedily

@KritixiLithos S and ~S are guaranteed to produce the same result

orlp

@LeakyNun there isn't really a fast way of doing it

or at least not a fast way that speeds up the whole thing, assuming I understand what you want to do

Leaky Nun

what I want to do is that, when we check S, we don't check its reflection

orlp

@LeakyNun it may be possible to iterate through all possible w in a different order such that all reflected S are at the end (and can thusbe skipped)

Leaky Nun

@orlp however, I have no idea how to do it

orlp

15:44

something like a gray code

@LeakyNun I might make a PPCG challenge out of this :D

Lembik

@orlp hang on! :)

orlp

@Lembik ?

I mean only for the reflected ordering part

not your problem

New Main Posts

2

Q: Extended Truth Machine

Many people know what a truth machine in programming is. But is time we kick things up a notch. Introducing, the extended truth machine! An extended truth machine takes two things as input, a integer n and a nonempty string s. It outputs s n times with optional trailing whitespace. However, if n ...

code-golf string

Lembik

@orlp I was only joking

I think I have to bite the bullet and agree to run people's code on my windows machine

I am trying to work out which languages are going to be hard

question edited

PhiNotPi

16:02

@Dennis TBH this is pretty unintuitive

Dennis

No arguments here.

orlp

@LeakyNun codegolf.stackexchange.com/questions/124384/…

Okx

@orlp NMP isn't going to be very happy with that

orlp

NMP?

Okx

New Main Posts

orlp

16:13

I'm confused

Okx

Erik the Outgolfer

@Okx where is that

New Main Posts

1

Q: Reflective binary ordering

The reverse of an n-bit number is just its n binary digits in reverse order: 001010010 → 010010100 Given a number n, generate the all n-bit integers ([0, 2n-1]) in an arbitrary order, with only one restriction: there must be a splitting point such that the reverse of an integer is on the o...

code-golf binary

0

Q: Is there an unmatched parentheses in this String?

Introduction Given a String containing an arithmetic expression, your task is to output a truthy or falsey value based on whether it contains unmatched parentheses. Input Your program should take in a String containing an arithmetic expression. It may take input in any way except assuming it...

code-golf string decision-problem

Erik the Outgolfer

@Okx but he didn't onebox it

also, ^^^

Okx

@EriktheOutgolfer chat.stackexchange.com/transcript/240?m=37600802#37600802

Erik the Outgolfer

16:17

oh wait I've already starred that

wait PPCG is 88th SE site CR is 86th >_>

and 87th is closed

Kritixi Lithos

@EriktheOutgolfer what ranking is that?

Erik the Outgolfer

reputation leagues id

assuming it goes in order of oldest to newest

orlp

@LeakyNun my lastest challenge (not the binary reflective one) is really interesting

should be fun to solve :)

Leaky Nun

@orlp I just upvoted it

Kritixi Lithos

@orlp I take it ^ is exponentiation?

"infinite power tower" so it is exponentiation

New Main Posts

16:30

1

Q: Output the nth Even Perfect Number

Challenge Given an integer, n, as input where 0 <= n <= 2^10, output the nth even perfect number. Perfect Numbers A perfect number is a number, x where the sum of its factors (excluding itself) equals x. For example, 6: 6: 1, 2, 3, 6 And, of course, 1 + 2 + 3 = 6, so 6 is perfect. If a per...

code-golf math number

1

Q: Evaluate modular power towers

Given two numbers n and m, evaluate the infinite power tower: n^(n+1)^(n+2)^(n+3)^(n+4)^... mod m Keep in mind that ^ is right-associative. So 2^3^4 = 2^(3^4). Now how can you possibly assign a value to an infinite sequence of right-associative operators? Define f(n,m,i) as the power towe...

code-golf arithmetic

orlp

@KritixiLithos correct

Leaky Nun

@orlp is there a theorem like the Euler totient theorem for non-coprime integers?

orlp

@LeakyNun you're on the right path, but no there isn't (AFAIK) just some direct identity you can apply

Leaky Nun

:(

that isn't good

Luis Mendo

@BetaDecay Why did you delete the challenge? People may have been working on it (I was)

Leaky Nun

16:34

@LuisMendo it's undeleted

Luis Mendo

Ah, thanks

Arjun

@BetaDecay You stole my views!

Beta Decay

@LuisMendo Yeah, sorry, I had a moment of doubt. Peter Taylor said I should restrict the challenge to generating Even Perfect Numbers and, I've completely misunderstood what he meant :P

@Arjun Haha sorry :D

Luis Mendo

@BetaDecay I hadn's seen it was already undeleted :-)

Lembik

17:03

hi @LeakyNun

Leaky Nun

hi

Lembik

so do you think I can post the question?

Leaky Nun

I don't know

Lembik

ah :)

why so?

Leaky Nun

ask others

Lembik

17:05

I am hoping there are clever ways to approach the problem

@LeakyNun not many people look at sandboxed questions sadly

@LeakyNun in theory there could be a closed form answer... but that seems tricky

Erik the Outgolfer

@Lembik not Leaky, but I'd suggest you edit the sandboxed post so that it gets more attention (it will bump)

Okx

@EriktheOutgolfer I added assign in Neim, just letting you know (and there's now a chatroom that will probably be mostly dead all the time)

Erik the Outgolfer

you're such an on-topic person...+1

orlp

@MartinEnder I can only notify one person in a comment, but codegolf.stackexchange.com/questions/124391/…

Lembik

@EriktheOutgolfer hi.. You mean edit it every few hours? I only wrote it recently

Erik the Outgolfer

17:20

oh

Lembik

@EriktheOutgolfer this is it codegolf.meta.stackexchange.com/a/12706/9206

Martin Ender

@orlp did you mix up n and m in the limits?

orlp

@MartinEnder I believe I did

@MartinEnder fixed now

Lembik

installing gcc on my poor windows machine in anticipation

@MartinEnder hi

MD XF

@Mayube Just curious - have you golfed anything else in Decimal?

orlp

17:28

@Lembik github.com/orlp/dev-on-windows/wiki/Installing-GCC--&-MSYS2

Lembik

@orlp I just followed preshing.com/20141108/how-to-install-the-latest-gcc-on-windows

Arjun

Help : Can I use an external DVD burner, which does not explicitly state that it is compatible with Windows 10, with Windows 10?

Lembik

I hope that's just as good

ok now I have C and python.. what else is there ? :)

MD XF

@Arjun Google for - then download and install - the proper drivers, and you should be fine

Lembik

@Arjun what is the make and model?

MD XF

17:32

^ google that and add "windows 10 drivers" to the end of the query

musicman523

is anyone here familiar with Lenguage

MD XF

@musicman523 I'm familiar with how ridiculous it is

musicman523

Fair

In Lenguage, how do you tell the difference between the BF program "+" and "++"?

Erik the Outgolfer

why would you need to?

they're both "do nothing"

musicman523

It's a theoretical question

Because I can't seem to tell the difference between "." and "+." and "++." and so on

Okx

17:38

CMC: Given a string and a number as input, append the number to the end of the string, but if the string ends with a number, first remove that before appending (abc123 + 33 -> abc33; abc + 123 -> abc123)

musicman523

Because + has the value 000, so it doesn't seem to affect the length of the Lenguage program

When it comes at the beginning of the BF program

Okx

@musicman523 You prefix with a 1, so + -> 1000 (in binary) and ++ -> 1000000

musicman523

Do you do that for all commands? It doesn't appear to say so on the Esolangs page

Kritixi Lithos

@Okx JavaScript, 27 bytes, s=>i=>s.replace(/\d+$/,``)+i

takes input by currying

musicman523

Oh wait no, you just prefix the PROGRAM with a 1. Gotcha :D

MD XF

17:45

Hey @DestructibleLemon I'm beating you in the monthly ranking now :P

TuxCopter

Nooooo

Squad has been aquired by Take-Two

orlp

@Lembik don't, that's outdated as hell

follow my guide

Lembik

@orlp argh! When you say outdated do you mean the version of gcc you get is old?

there is some advantage to using the cygwin installer

orlp

18:08

@Lembik that, and cygwin is inferior to msys2 in various aspects

just follow my guide, should take 10 mins

Okx

18:21

Should I post the CMC I made a bit ago as a challenge?

MD XF

@Okx Which one?

Okx

The one at the top of this page :P

MD XF

You know, I'd really like to see this post. It's deleted but I can see deleted posts. How can I find it :P

:(

Okx

I can try and find it for you

MD XF

Still :(

Oh come on :(

Doorknob

18:29

Only moderators can search for deleted posts.

Leaky Nun

> Note: only content you own is returned when searching for deleted content

MD XF

@Doorknob Oh, darn. Are you allowed to link it?

Okx

codegolf.stackexchange.com/questions/60206/…

Found it.

Erik the Outgolfer

@Doorknob dunno why

Leaky Nun

there are two undelete votes...

MD XF

18:30

@Okx Thanks!!

Erik the Outgolfer

why was spam starred?

@LeakyNun wait you voted to undelete?

Leaky Nun

@EriktheOutgolfer no i didn't

Erik the Outgolfer

because there was only 1 undelete vote before you said that

iirc

Leaky Nun

wat

MD XF

@EriktheOutgolfer Idk maybe this?

Okx

18:31

Wasn't that hard, just went to the TNB chat history for the day it was posted (which I saw in the image) and found it pretty easily there

Erik the Outgolfer

@MDXF and that's exactly why that question was locked

MD XF

@Okx Oh lol

@EriktheOutgolfer Because of spam?

Leaky Nun

> Post Undeleted by betseg, MD XF, Doorknob♦

Erik the Outgolfer

because he wanted to clear the undelete votes

MD XF

Exactly

@EriktheOutgolfer ninja'd, was about to say that

Erik the Outgolfer

18:33

@MDXF why did you vote to undelete?

Doorknob

@MDXF Your edit/delete privileges are not meant to be used as a joke. Please don't abuse them as such.

MD XF

> because we wanted to clear the undelete votes

Erik the Outgolfer

huh?

MD XF

I figured if it got undeleted, it could then get re-deleted, and have no undelete votes

Erik the Outgolfer

mods can undelete then delete again single-handedly, no need to vote to undelete

MD XF

18:34

@EriktheOutgolfer Ohh

That's right. Sorry

New Main Posts

-1

Q: Dankify this string

Challenge An ascii string is made 'dank' when a exactly one space is inserted between any two consecutive letters and all capital letters are replaced with lowercase ones. In this challenge I would like you to write a program that takes a string (not necessarily 'dank') as input and outputs a 'd...

code-golf string

MD XF

Ugh. Where's that Mother Meta post about why the rep cap?

Okx

Not finding that one for you :P

MD XF

I still can't find it

Transcript for