Background
Fibonacci trees \$T_n\$ are a sequence of rooted binary trees of height \$n-1\$. They are defined as follows:
\$T_0\$ has no nodes.
\$T_1\$ has a single node (the root).
The root node of \$T_{n+2}\$ has \$T_{n+1}\$ as its left subtree and \$T_n\$ as its right subtree.
T0 T1 T2 ...
Given a rod of length n inches and a list of prices that contains prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces. For example, if length of the rod is 8 and the values of different pieces are given as following, the...
Any ideas for what less than, greater than, etc. should do on arrays? I did have them doing includes and indexOf, but I realized I already have operators that can do that.
Is there a name for addition, but you flip the sign of the second number if the first is negative? Like 4 + 2 = 6, 4 + -2 = 2, -4 + 2 = -6, -4 + -2 = -2?
Yes, I've checked this post (How are bytes counted in assembly), but I'm asking a different question. I'm asking, if I have an .asm file, an .obj file and an .exe file, which one should I submit? Which part in the code should I submit? Especially for .obj files and .exe files -- I have no idea wh...
Count unrooted, unlabeled binary trees of n nodes code-golf combinatorics sequence binary-tree
An unrooted binary tree is an unrooted tree where each vertex has exactly one or three neighbors. It is used in bioinformatics to show evolutionary relationships between species.
If such a tree has \$n\...
Challenge
The challenge is to implement the bottom encoding (only encoding, not decoding). There is a wide variety of existing implementations in the bottom-software-foundation org.
Bottom is a text encoding where each character is separated into multiple emoji.
Unicode escape(s)
Character
Va...
What is Permutation Coefficient
Permutation refers to the process of arranging all the members of a given set to form a sequence. The number of permutations on a set of n elements is given by n! , where “!” represents factorial.
The Permutation Coefficient represented by P(n, k) is used to repres...
Ginormous number code-golf kolmogorov-complexity number
Output this 1364-digit base-10 number:
1034606317538277595498321496528894235185361253638203466390593510146122206054819577408494150412777902779548471104874628926909551302791043849890675122564819776659006445796546131413014994215254507471207400...
Is the Skat null game safe? [WIP]
For everyone who knows the card game Skat. Did you ever wondered when playing a null game: is this really safe to win regardless the other player cards? Well, let's try to solve this question with code.
The Skat game
Skat is card game with 32 cards. There are fou...
Hmm, now I'm thinking about switching Ash back to prfix, since it turns out stack based adds more bytes for functions and mapping over arrays, and the main benefit for golfing that I thought it'd add is shorter with prfix anyway
Definition
Fibonacci sequence F(n), on the positive integers, are defined as such:
1. F(1) = 1
2. F(2) = 1
3. F(n) = F(n-1) + F(n-2), where n is an integer and n > 2
The Fibonacci-orial of a positive integer is the product of [F(1), F(2), ..., F(n)].
Task
Given positive integer n, find the ...
I realized the main benefit was something I wasn't actually using in the first place, and implicitly converting operators into functions is way easier with prfix
I've managed to trick them for now by registering a fake school-related domain and routing some stuff through there, but it won't work for anything requiring security