Compressing your source code
Some language provide builtin facilities to compress data and execute the result as source code. I consider this to be a standard loophole, especially when the challenge is counted in characters instead of bytes.
Erlang, 748 bytes
A 7-bit clean version without gzip-9 is 748 bytes:
f()->[maps:get(C,#{$N=>"ing",$x=>10,$q=>"th",$z=>" Christmas"},C)||C<-s(t(calendar:local_time()))].
t({{_,1,D},_})->D+7;t({{_,12,D},_})->D-24;t(_)->1.
s(X)when X<1;X>12->L=" I wish it could bez every dayx","Well"++L++"When q...
gzip, 114 bytes
Hexdump:
1f8b080853f9975502006c006dd04b0a80300c84e1bde01dbc40218fa6697aff8309e2a6fa6f3f86cc10adb426a3b95ce62b6a0d398f07d59aeb8e4ed80983701026e1242cc0a9307e1aa11306615211b59710527b3961270cba9994fc7fc944829092faeedc313e7803993cfafb20020000
Create a file with the bytes described a...
This question has come up recently in my mind as I have been looking through popularity-contest challenges and shortest-code-wins challenges. This question specifically is:
How should I pick a winner when either
(a) the number of bytes in a shortest-code-wins challenge is equal between the s...
1:N probability (Simple)
code-golfprobability-theorylogic
Because there are not enough simple code-golf challenges:
Create a named program or function that, given (by any means) an integer N ≥ 1, outputs your language's TRUE value with a pseudo-random probability of 1:N, FALSE otherwise.
Some...
00:00 - 04:0004:00 - 06:0006:00 - 11:0011:00 - 16:0016:00 - 19:0019:00 - 21:0021:00 - 23:0023:00 - 00:00
-4
5
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.
The "game" is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves or, for advanced players, by creating patterns with particular properties.
== RulesEdit ==
The universe of the Game of Life is an infinite two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, alive...
The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this aspect it is similar to Conway's Game of Life. Also like Life, Rule 110 is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.
== Definition ==
In an elementary cellular automaton, a one-dimensional pattern of 0s and 1s evolves according to a simple set of rules. Whether a point in the pattern will be 0 or 1 in the new generation depends on its...
69
The number e is an important mathematical constant that is the base of the natural logarithm. It is approximately equal to 2.71828, and is the limit of (1 + 1/n)n as n approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series
The constant can be defined in many ways. For example, e can be defined as the unique positive number a such that the graph of the function y = ax has unit slope at x = 0. The function f(x) = ex is called the exponential function, and its inverse is the natural logarithm, or logarithm to base...
00:00 - 04:0004:00 - 06:0006:00 - 11:0011:00 - 16:0016:00 - 19:0019:00 - 21:0021:00 - 23:0023:00 - 00:00
