@Mego There's also a way to delete high-rep users without losing votes (like ais I think), and while I'm not a high-rep user, I still think they maybe should've preserved votes ¯\_(ツ)_/¯
but my hatred of Stack Exchange was leaking into my love of code golf; I thought my love for code golf would make Stack Exchange more palatable, but it happened the other way round
People usually say 24 hours and this is the first time it's been a problem
Anonymous
24 hours is usually on the low side - I only suggest that for challenges that you really are sure are good, but just want to make sure nobody else sees anything you don't.
Anonymous
"I've been thinking about this and working on it for a week" -> 24 hours is probably ok. "I just came up with this idea and immediately sandboxed it" -> longer is probably better.
@wizzwizz4 This. It's tracked, but the message implies that the imaginary vote will get transformed into a real vote after registering and getting enough rep, which is false.
@totallyhuman I came up with this: lambda s:s[0]==s[-1]and any(any({*s[::2]}=={u[x]}and{*s[1::2]}=={u[x<1]}for x in[1,0])for u in['nu','mw','bp']), which is 4 bytes shorter than yours, but I noticed it is very similar. Would you allow me to post it? Posted.
Challenge inspiration was this that I saw somewhere:
The word "nun" is just the letter n doing a cartwheel
Your challenge is to take a string and determine if it is the first letter doing a cartwheel.
Rules
A string is a letter doing a cartwheel if:
The first letter is the same as the l...
The family is threatened when its individual members feud and pursue only their personal interests
It is only a matter of time before mankind, achieves that goal, unless civilization should relapse
It is a problem that will inevitably remain without solution until the process of the unification of languages has passed through time, provided that the hereditary factor loses its effect on subsequent generations through the passage of sufficient time
Later, new means of production were added to the process
In StackExchange chat, there used to be an animation when a user joined or left a chatroom. In the little group of favicons below the chatroom name:
When a user joined, their favicon would float from the top towards that list. When they left, it would float from that list to the bottom left.
...
For example, it would be really useful if 1) You could suspend a user from one room, and 2) ROs had a minimal suspending ability (for the rooms they own)
And chat flags should be slowly rolled out. For example 1) Mods/ROs 2) 10K users who frequent or are in that room 3) 10k users from the parent site 4) network wide
@Okx Part of my chat interface is a system to post the current working message with an appended " -" if my main process is suspended, then to make a crash dump.
CHANGELOG: totallyhuman posted an answer, I outgolfed him, both the answers were invalid, totallyhuman fixed his, I deleted mine. Another answer longer than both was posted in the meanwhile. I came up with a good approach, outgolfed both. Then another answer appeared that outgolfed us, I outgolfed that answer. In the end, vaultah appeared and outgolfed all of us.
Python 2, 164 148 132 77 bytes
-16 bytes thanks to Rod's suggestion elsewhere. A frickin' -55 bytes thanks to Arnold Palmer.
n=[min(int((ord(i)-58)/3.13),9)for i in input()]
print sorted(n)in[n,n[::-1]]
Try it online!
Input must be uppercase. Outputs True or False based on its orderedness....
Challenge inspiration was this that I saw somewhere:
The word "nun" is just the letter n doing a cartwheel
Your challenge is to take a string and determine if it is the first letter doing a cartwheel.
Rules
A string is a letter doing a cartwheel if:
The first letter is the same as the l...
Python 2, 164 148 132 77 bytes
-16 bytes thanks to Rod's suggestion elsewhere. A frickin' -55 bytes thanks to Arnold Palmer.
n=[min(int((ord(i)-58)/3.13),9)for i in input()]
print sorted(n)in[n,n[::-1]]
Try it online!
Input must be uppercase. Outputs True or False based on its orderedness....
