Quote notation[1] is a way of expressing rational integers in a precise, finite manner, based on the concept of \$p\$-adic numbers. The notation is in the form of a string of digits (\$0123456789\$) containing exactly one "quote" (a \$\newcommand{'}[2]{#1\text{'}#2} \text{'}\:\$) and one "radix p...
Given a string, output a Brainfuck program that outputs that string.
Pretty self explanatory.
https://en.wikipedia.org/wiki/Brainfuck
Code golf, so shortest program in bytes wins.
ABC ABC is an esoteric programming language and it is accumulator based. It has 9 commands:
a - Increment the accumulator
b - Decrement the accumulator
c - Output the accumulator
d - Invert accumulator
r - Set accumulator to a random number between 0 and accumulator
n - Set accumulator to 0
...
Death-onacci sequence (WIP)
The traditional Fibonacci sequence grows forever:
1 1 2 3 5 8 13 21 ... 1,346,269 ...
and is given by this formula:
f(n) = f(n-1) + f(n-2)
where the initial numbers in the sequence are 0, 1.
However, there's a set of as-yet unnamed sequences, where a previous number ...
Marshall Lochbaum's online BQN REPL has an interesting(and aesthetically pleasing) method of displaying arrays. Your task is to implement a version with simpler rules.
[2,[3],4,[[[6,[5],7]]]]
becomes:
┌─
· 2 ┌· 4 ┌·
· 3 · ┌· ...
It's possible that a language can only do lots of brute force, even for quite simple questions
Inspired by this challenge, and similar to this and this.
After seeing these, I figured I would continue the trend as there was no inclusive/exclusive sum.
The goal here is to sum an interval of integers, either inclusive and exclusive, and output the total to stdout.
Input format: either a ( or ...
