@CᴏɴᴏʀO'Bʀɪᴇɴ only if the downvotes are for the same person - I don't think there's an algorithm running to detect downvotes on a language. (I don't know though...)
Does anybody here think it would be a good idea to add a validity requirement in which the submissions must pass a certain test to deemed viable for my current challenge here?: codegolf.stackexchange.com/q/78325/52405
What you need to do is create a Boolean parser.
Boolean expressions, in case you haven't heard of them yet, have two inputs and one output. There are four 'gates' in boolean arithmetic, namely OR (represented by |), AND (represented by &), NOT (which are used a bit like brackets : / and \ note...
What you need to do is create a Boolean parser.
Boolean expressions, in case you haven't heard of them yet, have two inputs and one output. There are four 'gates' in boolean arithmetic, namely OR (represented by |), AND (represented by &), NOT (which are used a bit like brackets : / and \ note...
@KennyLau In network-general terms, you shouldn't edit questions to change their meaning; only to correct them (unless you have permission from the OP). I don't know if any PPCG-specific rules change that for challenges, though.
Introduction
Given an input of a block of string containing 1 or more of each character in !@#$^&*, output in any reasonable format the coordinates of the switch(es) that is/are "on".
A switch is a $, and a switch is classified as "on" if and only if it satisfies at least 1 of the following c...
@CᴏɴᴏʀO'Bʀɪᴇɴ In normal operation, seconds. It's offloaded from the response thread to a background task, so it's not immediate, but the queue shouldn't be long under normal ops.
> Hey, we noticed something kind of odd: you are downvoting all answers in golfing languages. While you are free to your vote, I must ask you for your rationale in doing this. Golfing languages are already a part of the site, and are rather common. Most challenges are in fact without answers from golfing languages.
In chess, Forsyth-Edwards Notation, more commonly called "FEN", is a textual way of transcribing boards. It describes each of the board's eight rows (called "ranks" in chess) from top to bottom from White's perspective. The pieces are written as K (king), Q (queen), R (rook), B (bishop), N (knigh...
The only way to get those votes removed is to contact a CM through the mods, but the CM's won't do anything because there's nothing technically wrong with how he's voting.
There was (is?) a case, not long ago, of a user who joins every site, and upvotes everything indiscriminately. It's pretty similar - instead of downvoting good content, they're upvoting bad content. Yet, the verdict was "leave it alone; it's not abuse".
The mod team on Open Source had all the evidence we needed to show that this user had upvoted everything, including closed and heavily downvoted stuff. It was all public, too. Yet the decision was still "not abuse".
@Optimizer don't have one right now, but it'll be under a voting tag on MSE somewhere.
Ah, I misremember. The outcome was "it's problematic, but there's not a lot we can do - be very careful enforcing this".
I've had a few concerns over a new form of "spam" - that is, through voting.
A while back, I had seen some wild reputation increases to my account, amongst others, that seemingly felt weird - as I've barely participated in asking questions or providing answers. Earlier today, this sentiment was...
Pyth - 24 bytes
jm++K\|jKdKcu:G`H*Hd9z\/
Test Suite.
What you need to do is create a Boolean parser.
Boolean expressions, in case you haven't heard of them yet, have two inputs and one output. There are four 'gates' in boolean arithmetic, namely OR (represented by |), AND (represented by &), NOT (which are used a bit like brackets : / and \ note...
Introduction
Given an input of a block of string containing 1 or more of each character in !@#$^&*, output in any reasonable format the coordinates of the switch(es) that is/are "on".
A switch is a $, and a switch is classified as "on" if and only if it satisfies at least 1 of the following c...
