In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of remarkable and deep properties. It was discovered in 1874 by Henry John Stephen Smith and introduced by German mathematician Georg Cantor in 1883.
Through consideration of this set, Cantor and others helped lay the foundations of modern point-set topology. Although Cantor himself defined the set in a general, abstract way, the most common modern construction is the Cantor ternary set, built by removing the middle thirds of a line segment. Cantor himself mentioned the ternary construction only in...
The Challenge
Build a N-Leveled Cantor Set.
The Cantor ternary set is created by repeatedly deleting the open
middle thirds of a set of line segments.
The program receives one parameter N (a integer number) and then prints (in console or similar way) a Cantor Set of N levels. The print ...
I was looking at my previous challenge and thought I could make a better version, but I didn't want to modify that one, so here it is!
Challenge
Given an input n,
print an ASCII art cake n layers tall,
viewed from the side,
with two candles on top,
using box drawing characters.
First laye...
Inpsired by a youtube video from a fellow PPCG user...
You challenge is to use ASCII-art draw a Minecraft castle wall of Andesite and Diorite. The shape of the wall is the Cantor Set. For reference, the Cantor Set is made by repeating the following N times:
Triple the current step
Replace the ...
Turtlèd, 135 bytes (not competing)
To be honest, I think I might have made this too large, might golf some bytes off by making it simpler
#3699718841795024338322384626535897933.1415926#10:,;[*'|u]')[*')l'(l]l"()"[|d'\r]ll'_l'_uu[(ddl'\uuu]d'|d"|:"d[_"::"d]rru[)[|.+r][\l]u]
Explanation
Honest...
69
Challenge
The challenge is to write a small little function(method), printing a number of how many repeats a given array of numbers has.
What are repeats?
Let's say our array is a collection of timestamps in seconds.
Something like this: [1, 5, 7, 8, 10, 11, 15, 17, 18, 20].
You may notice tha...
Fourier, 196 bytes
New feature alert!
Code
|SaCaaSa|f6(40a41ai^~i)10a~N124a~P92a~S3o46a1415926oPaNaPa58a~CSa53589793oPaNaf2384626oPaNa32a~Wf433832oPaNaWaaf79502oPaNaWaaaf8841oPaNaWaaaaf971oPaNaWaaaaaf69oPaNaWaaaaaaf3oPaNaWaaaaaaaSa95aaSaPa
Explanation
This program is my first demonstration ...
7
GNU sed, 496 485 + 2(rn flags) = 487 bytes
1h;1b;$bb;2{:r;$!N;$!br;s/.*/echo "&"|sort/e};:b;x;/[dD]/bd;/c/bc;/u/!b;x;s/^/\n/
s/(\n.*)\1+//g;s/\n//p;b;:d;x;/^(.*)\n\1/!D;:l;x;/D/{x;P;x};x;s/^[^\n]*\n//
/^(.*)\n\1/bl;P;D;:c;s/$/#/;G;x;/^$/bp;s/[^\n]*\n?//;x;s/#(\n[^\n]*).*/\1/
/([^:\n]*)\n\1$/{s/\...
Take two lists of non-negative integers, and output an ASCII-box as it's defined below.
Corners and intersections are pluses: + (ASCII-code 43)
Vertical lines are bars | (ASCII-code 124)
Horizontal lines are minuses - (ASCII-code 45)
The first input list specifies the number of minuses betwee...
Please do not delete this without reading it and Please do not mark this as duplicate. Put it in unclear if there are some questions. I will respond immediately.
If you feel that this is duplicate please copy the solution here and comment but please do not mark as duplicate
This is different fr...
