Positionally, 33 bytes / v + , ; < / Try It Online! Positionally is a language I made where there are only two commands - space and non-space. The instruction run depends on the position of the IP. The characters in the above could be any character aside from spaces. Position...

Introduction A circle-tangent polynomial is a polynomial of degree \$N\ge3\$ or above that is tangent to the unit circle from inside at all of its N-1 intersection points. The two tails that exits the circle are considered tangent at their intersection points from inside as well. You may consider...

The prime frog 🐸 -- Integrated. From the original question, we make the following changes: The "prime frog" is a strange animal that jumps between integers*, until it arrives on 3 or 19... Your program should accept an integer n as input and output the result of the below algorithm (3 or 19). ...

Interpret BigTalk Talk is a language which takes a single bit of input and has four commands: 00 If the accumulator is 0, set the accumulator to 0. 01 If the accumulator is 0, set the accumulator to 1. 10 If the accumulator is 1, set the accumulator to 0. 11 If the accumulator is 1, set the accu...

Say I have a ragged list, like: [ [1, 2], [3, [4, 5] ] ] And I want to iterate over each item and delete it one-by-one. However, I don't know the structure of the list. So, I have to iterate over the list, with the following algorithm: Look at the first item of the list. If it's a li...

C (standard compliant), 78 bytes int f(int n,int k,int c){return n?n+c-k?k-c?f(n-1,k,0)+f(n-1,k,c+1):1<<n:1:0;} pour la version lisible: int f(int n,int k,int c){ if(n==0)return 0; // no more coin flip left => no possible path if(n==(k-c))return 1; // last coin flip and 1 tail is lacking ...