0
INPUT: Any string consisting exclusively of lowercase letters
OUTPUT: A number that will represent the sum of the distances of the letters according to the following metric:
You take the first and second letter and count the distance between them, the distance is defined by the QWERTY keyboard ...
A geek friend of mine said that this was what he was listening to and I'm apparently supposed to figure it out:
(?ix)(?![AD-ZC][a-jn-zjm])
(
([[:upper:]])
[[:lower:]]
)
(?=[a-z])
(?!b-z)
(.)
ck
(
(?!\t\r\n\f)
\s
)
(
(?=[A-Z])
(?![A-R])
(?![T-Z])
.\3\2\2\3t
(
(h)
)
)
\4\-\...
I realize that as per the ask/don't ask the answer is "no", but if I go to StackOverflow how many people are going to answer a question about Fish or CJam?
I feel like questions about golfy languages maybe should be on topic here.
Following computes the number of bits set in an integer.
int main() {
int num = 7, mask = 1;
int setBitscount = 0, cnt = 0;
while(num) {
if(mask & num)
setBitscount++;
num >>= 1;
}
printf("%d\n", setBitscount); return 0;
}
Using ternary operators, this can be done in a single line, ...
A leap second is a one-second adjustment that is occasionally applied to Coordinated Universal Time (UTC) in order to keep its time of day close to the mean solar time, or UT1. Without such a correction, time reckoned by Earth's rotation drifts away from atomic time because of irregularities in the Earth's rate of rotation. Since this system of correction was implemented in 1972, 25 such leap seconds have been inserted. The most recent one happened on June 30, 2012 at 23:59:60 UTC. A leap second, the 26th, will again be inserted at the end of June 30, 2015 at 23:59:60 UTC.
The UTC time standard...
Since today marks the occasion of the 26th leap second ever to occur, your challenge will be to output the date and time of every leap second in GMT or UTC that has occurred so far, as well as the one to occur today.
Input
There is no input.
Output
1972-06-30 23:59:60
1972-12-31 23:59:60
1973...
Prelude
Maybe I can increase Prelude adoption a bit if people can just play around with it in their browsers, so here is a JavaScript interpreter. It's based on Sp3000's nifty Brainfuck interpreter, whose killer feature is interruptible execution and an optional time out.
var ITERS_PER_SEC ...0
This is a code golf Problem. Given an integer T followed by T different number of integers. All we need to do is to calculate the total number of multiples of 3 from the inputted numbers. Since this is a Code golf question the target is to bring it down to less than 34 characters. I worked out a ...
Tokenize a String
Take in a string through STDIN or function parameters, tokenize it by parenthesis, and output the tokens on different lines. If the string contains a parentheses error, output a falsey value or error message.
Examples:
Input: abc(def)ghi
Output:
abc ghi
def
Input: ...
