Retina, 152 95
Massively golfed with @Martin's help! Thanks Martin!
^
SuMoTuWeThFrSa
([A-Z].)(?!.*\1)
Tu(W|T).
T$1
T`\oer
WTh
WT
Su\B|\BSa
S
^MTWTF$
D
SS
E
.{7}
A
Try it online. A couple of the lines start with m` with this online interpreter link. This is so the program works with multip...
Vitsy, 8 bytes, 8 distinct character, ∞ programs (score 0)
This is a simple proof in another stack-based language of Mego's comment.
'Drd3*Z1
' rd3*Z Standard quine formula
D 1 Increase the number of ones every output (output 1 will have 11,
2: 111, 3: 1111, etc.)
The goal of this challenge is to complete a list of consecutive nested header numbers when given a start and an end. When given 1.1.1 and 1.1.5 you should generate 1.1.1, 1.1.2, 1.1.3, 1.1.4, 1.1.5
Specific Rules
Your entry must take in a start, end, and multiple optional range parameters. P...
CJam, 101 bytes
qN/_z,f{' e]}{S2*f+W%z}4*:eeee::f+:~{_(aL{+_{_2,.+1$2,.-Y$_2<:+2%!2*(a.+}%2${a1$&},\;@1$-@@}h;\;-}2*!
Try it online.
I finally overcame my fear of implementing a flood fill in CJam. It's about as ugly as I expected, and it can most definitely be golfed.
The general idea is to...
PowerShell, 91 74 bytes
Woo! My 100th answer on PPCG!
param($n,$k)(1..$n-join'*'|iex)/(($k|%{$n-=$_;1..$_})+(1..$n)-join'*'|iex)
Whew. Not going to win shortest-code, that's for sure. Uses a couple neat tricks with ranges, though. And this is probably complete gibberish to anyone not familiar...
king-of-the-hilljavascript
City Life
A cellular automation war game.
Each player will control group of cites on a grid. Each city takes up one cell, and all cells with no city are "wilderness", and have no owner. The board will start with one city controlled by each player. The game will consi...
brainfuck, 238 bytes
,[[<+<+>>-]-[<<-->>-----]<<+++++[----[----[------[------>>]]]]>[>>]>,]<+++++[<++++++>-]<[<[-<<]>>[>>]>+<<-]<--[<<--]>>[++>>]>[<<<[+<<]<<[+<<]>>[>>]>>[>>]>-]<<<[<<]----[<+++++>--]<->>[>.>]<[<<]<<[<<]>[>>]>[.>>]<.<[<<]>[>.>]>[>>]>[>>]>[.>>]
Requires , to return 0 on EOF, 8-b...
The interpreter(/compiler) defines the language
A spec is not a language. For the purposes of PPCG, a programming language is defined by its implementation.
If the interpreter is fixed after the challenge is posted, the answer must be marked as non-competing—just like any other answer in a lang...
Challenge:
Some ascii-art is a pain to make, but makes code comments easier to read, especially when the code is dense. The challenge is to make a simple tool that converts comments to simple ascii-art with arrows. The comments to modify are delimited by empty comments.
For example, supposing H...
Newton's theory of gravitation says that the gravitational force between two point masses is
F=(Gm1m2)/ r2
Where
G is the gravitational constant: 6.674×10−11 N · (m/kg)2
m1 is the mass of the first object
m2 is the mass of the second object
r is the distance between their centers of mass
...
TLDR: This is a follow-up to our initial proposal for transitioning to a more user-friendly code license. The purpose of this post is to address the concern expressed most frequently in response to the initial proposal: no attribution requirement. Also, we want to make sure everyone has ample ...
I've been around for a while, watching you golf and I really enjoy it.
I came up with a challenge for you all so let's begin!
Challenge
I assume that everyone knows what Finite State Machine (FSM) is, I will edit the the description if needed.
Your program will take only one input consisting ...
