Replace all instances of first bracket type recursively until no more can be found.
Then do the same for the next bracket type.
And so on.
It won't go back and check if replacements of the 2nd bracket type creates possible matches of the first bracket type to replace.
Then do the same for the next bracket type.
And so on.
It won't go back and check if replacements of the 2nd bracket type creates possible matches of the first bracket type to replace.
The keyboard layout people commonly use is the QWERTY layout as shown below.
But there are also other keyboards layouts :
DVORAK
COLEMAK
WORKMAN
YOUR TASK
Your code will take two inputs : the name of the keyboard layout and a string.
Your goal is to convert your qwerty input as if y...
What I want:
Take an input, x
Take a formula. It has to be capable of reading something in the format:
ax^m + bx^n + cx^o ... where m, n, o and any terms after that can represent any value.
coefficients, again for any number. For example, 6x^2. (That means 6(x^2))
Doesn't necessarily have ...
Variably Incremented Chained Ranges code-golf
Your task will be, given a well-formed input string s, to parse it as a range, with special properties:
A traditional range is defined as a..b = [a, a+1, .., b-1, b].
An incremental range is an extension of the traditional range in the format a.c....
Your task is to find the nth Fibonacci number, but n is not necessarily an integer.
The Fibonacci sequence, 0-indexed, goes as follows:
0, 1, 2, 3, 4, 5, 6, 7, ...
1, 1, 2, 3, 5, 8, 13, 21, ...
However, what happens if we want the 2.4th number?
The 2.4th number is 0.4 times the differenc...
As you are maybe aware by now, Brain-Flak's Birthday is coming up soon! This is the third challenge leading up to the big event. Find out more here.
Challenge
For this challenge your objective will be to find the very first pair of matching brackets in a fully matched string of ()[]{}<> bra...
MicroVersion: Planned service degradation: All Stack Overflow/Stack Exchange sites read-only for 20 minutes on Wed, May 3, 2017 shortly after midnight UTC (8PM US/Eastern). If you blink, you'll miss it.
Short version:
There will be a service degradation for up to 20 minutes shortly after midnig...
This is a variant on the self-replicating program, defined here as a program that outputs its source (or a quine). Below is an example of a self-replicating program in Python:
s = 's = %r\nprint(s%%s)'
print(s%s)
When run from a file, this script should output itself.
Instead of a self-replic...
Brain-Flak, 685 bytes
((<()>)()){{}({}<(({}))((((()()()()()){}){}){})({}[{}]<(())>){((<{}{}>))}{}{(()<
>)(<><{}>)}{}(({}))((((()()()()()){}){}){}())({}[{}]<(())>){((<{}{}>))}{}{{}<>{}
(<>)}{}(({}))(((((()()()()()){}){})){}{})({}[{}]<(())>){((<{}{}>))}{}{(()<>)(<><
{}>)}{}(({}))(((((()()()()()){}...
Im wondering how steam knows Im playing a game so it can start itself first.How do you add your code into compiled app?
what is this called? How can I learn it? where can I learn it?
Your task is to write a program that outputs the exact string "Programming Puzzles" (trailing newline optional), but when all spaces, tabs, and newlines are removed it outputs "Code Golf" (trailing newline optional.)
Your byte count is the count of the first program, with spaces still there.
G...
