00:00 - 17:0017:00 - 00:00
Infinite Integer Derivative
We can consider the derivative of a integer sequence to simply be the difference between each element and the next:
1 5 8 13 2
4 3 5 -11
Note this will produce a sequence one shorter than the original. If we prepend the initial value we have perfectly describe...
Partial fractions code-golf
Given an input of a string, output the partial fraction in string form.
The partial fraction decomposition of a rational fraction of the form where f and g are polynomials, is its expression as:
Input:
In the form of an entire string:
(x+4)/(x+3)^2
Output:
In the fo...
0
In this Challenge, You are going to take a number and turn it to a String, but not in the common way, Actually in aaaaa way.
aaaaa way, Is simply writing the letter in the English alphabet With the index We have until 9(for example a for 1, 2 for b and ... 9 for i) in 5 letters string. For exampl...
0
In R print(x, digits=n) does something a little complicated.
It always shows all the digits to the left of the decimal point and then, if there are any digits to the right it rounds the whole number so that at most n digits are shown. However a solitary 0 to the left of the decimal point is not c...
In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.
== Formal definition ==
If we denote by SPACE(t(n)), the set of all problems that can be solved by Turing machines using O(t(n)) space for some function t of the input size n, then we can define PSPACE formally as
P
S
P
A
C
E
=
ā
k
ā...
Mario brick Block
In honor of the upcoming Mario movie, print this brick block art in the fewest characters possible.
._____.
|__|__|
|_|_|_|
!__|__!
Scoring
It's code-golf, so fewest bytes wins.
00:00 - 17:0017:00 - 00:00
