O, 75 bytes
[i'(-')-", "/]{[[n'-/]{n#}d[$,.$.0=0={.@=0={;.@=0=}w;}{;;}?r]]{n{noTo}d}d}d
This makes logical sense to anyone who built the language (i.e. me). The logic behind this is intense and I'm just happy that I got it working.
The goal of this challenge is to find the direction and area enclosed by a loop.
Input:
A rectangular grid consisting entirely of these characters: ^v<>
(Optionally, you may also be given the dimensions of the grid before the grid itself in decimal with a prefix, suffix, and separator characte...
You are given a set of natural numbers. You must arrange them into pairs such that:
Each pair contains 2 numbers, one of which is a multiple of another. For example, 8 is a multiple of 4, and 9 is a multiple of 9.
If the same number occurs many times in the initial set, it can be used that many...
Vitsy, 4 bytes
This language feature is newer than this question, but not made for this question.
iG`Z
i Grab input. Since there is no input, it pushes -1 to the stack.
G Get the class name of the referenced class. -1 refers to the current class.
` Read the file under the name of t...
Come November 1, Programming Puzzles and Code Golf will graduate, so in the next 11 months, we'll want to save some memories from when we were ungraduated.
Write a program that produces the PPCG logo, seen here. You can use whatever methods you want, from an image to ASCII or anything else.
...
The goal of this challenge is to produce an animation of a chain drive system, comprised of a set of sprocket gears connected together by a chain.
General Requirements
Your program will be given a list of sprockets, specified as (x, y, radius) triplets.
The resulting chain drive system is compr...
Brainfuck, 40 bytes
,[>>+>>,]<<[[<<]>>[-[<]>>[.<<->]>+>>]<<]
You can try the code on brainfuck.tk.
