COW, 426 bytes
MoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoO
MoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMoOMMMmoOMMMMOoMOoMOomoOMoOMoOMoOMoO
MoOMoOMoOMoOMoOMoOmoOoomMMMmoOMMMMOOmOomOomOomOoMoomoOmoOmoOmoOMOomoo
mOoMMMmoOMMMMOoMOoMOOmOomOoMoomoOmoOmOoMMMmoOmoOMMMMOoMOomOomOomOomOo
m...
Ascending Sequence of Characters (I-something I-something)
code-challenge printable-ascii
The full printable ASCII set (chars 32-126) in ascending order looks like this:
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
Your task is to create a...
Alphabetize Integers
For a given set of numbers, put them in alphabetical order when they are spelled out (i.e. 1: one, 2: two, 90: ninety, 19: nineteen). Your code should work for the range [-999999, 999999]. Output must have a delimiter between numbers. A space will work, as will a space and a...
Signs in Permutations
Introduction
Let's take the permutations of 123.
123
132
213
231
312
321
We can insert signs in between the numbers and count how many > signs there are:
1 < 2 < 3 # 0
1 < 3 > 2 # 1
2 > 1 < 3 # 1
2 < 3 > 1 # 1
3 > 1 < 2 # 1
3 > 2 > 1 # 2
We can arrange this in a tabl...
Java 7, 33 30 27 bytes
int a(){return hashCode();}
Because Java.
Pyramid Exponentiation
The Pyramid Exponentiation of an integer, PE(x), is defined as:
sum of (x^0, x^1 ... x^x ... x^1, x^0)
For example, PE(2) yields sum(1,2,4,2,1), which sums to 10.
PE(3) is sum(1,3,9,27,9,3,1), resulting in 53.
The Challenge
Given a natural number (n > 0), calculate...
