Sandbox for Proposed Challenges

Question

This "sandbox" is a place where Code Golf users can get feedback on prospective challenges they wish to post to main. This is useful because writing a clear and fully specified challenge on your first try can be difficult, and there is a much better chance of your challenge being well received if you post it in the sandbox first.

Sandbox FAQ

Posting

To post to the sandbox, scroll to the bottom of this page and click "Answer This Question". Click "OK" when it asks if you really want to add another answer.

Write your challenge just as you would when actually posting it, though you can optionally add a title at the top. You may also add some notes about specific things you would like to clarify before posting it. Other users will help you improve your challenge by rating and discussing it.

When you think your challenge is ready for the public, go ahead and post it, and replace the post here with a link to the challenge and delete the sandbox post.

Discussion

The purpose of the sandbox is to give and receive feedback on posts. If you want to, feel free to give feedback to any posts you see here. Important things to comment about can include:

• Parts of the challenge you found unclear
• Comments addressing specific points mentioned in the proposal
• Problems that could make the challenge uninteresting or unfit for the site

You don't need any qualifications to review sandbox posts. The target audience of most of these challenges is code golfers like you, so anything you find unclear will probably be unclear to others.

If you think one of your posts requires more feedback, but it's been ignored, you can ask for feedback in The Nineteenth Byte. It's not only allowed, but highly recommended! Be patient and try not to nag people though, you might have to ask multiple times.

It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed.

Other

Search the sandbox / Browse your pending proposals

The sandbox works best if you sort posts by active.

To add an inline tag to a proposal, use shortcut link syntax with a prefix: [tag:king-of-the-hill]. To search for posts with a certain tag, include the name in quotes: "king-of-the-hill".

Answer 1

pattern-matching sequence code-golf

Find all matches for the digit pattern

In an older challenge, you were tasked with finding numbers which, in base-ten, matched this specific digit pattern:

(n)(x)(n+1)(x)(n+2)(x)(n+3) etc...

Meaning any number between 4 and 18 digits long such that the digits could be considered as a string of increasing single digits interlaced with (at most) a constant single digit number.

For example, 19293949 would fit the pattern, with n being 1 and x being 9.

In this challenge, instead of deciding whether a given number fits one fixed pattern, you will be given a pattern as input, and are tasked with outputting the sequence of numbers which match the pattern.

Patterns

This section is a definition of what the patterns are and what they represent. A format similar to the one used in the original post will be used for these examples. More clarification on I/O rules will come afterward.

A pattern consists of one or more clearly delimited tokens, each matching a single base-ten digit.

(token)(token)(token)

Tokens can either be constants, accumulators, or a loop.

Constants are each marked with a single token, and there can be up to ten different constants, as each distinct constant represents a distinct digit from each other constant. Here it is represented as a single character from a to j in parenthesis ()

(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)

This pattern, for example, could match the number 1234567890, but not the number 1111111111.

Important note: Numbers cannot have leading 0s, so the pattern would not match 0123456789.

(a)(a)(a)

This pattern would match 111, 222, etc. all the way up to 999. It would not match 000, as it contains leading 0s, and it would not match 123, as all of the digits marked with the same constant must be the same.

Accumulators are marked with a single fixed symbol. The first instance of an accumulator represents any digit from 0 to 9, and each successive instance represents a digit that is one more than the previous instance. Here it is represented as (n+)

(n+)(n+)(n+)(n+)(n+)

For example, this pattern matches 12345, 23456, 34567, 45678, and 56789. Combining constants and accumulators is allowed, giving us access to patterns similar to that of the original challenge:

(a)(n+)(a)(n+)(b)(n+)(b)

Constants can't match the same digits as other constants, but they are allowed to match the same digits as accumulators. This pattern matches, for example, 9192838, but it also matches 1112333.

This isn't enough to support the pattern given in the original problem, so finally we introduce the loop token. This token can only appear at the end of the pattern, or not at all. Here it is represented as ...

(a)(b)(c)(n+)(n+)...

A pattern with the loop token matches all numbers that the pattern would if it did not have the loop, as well as all numbers matched by the pattern repeated twice, as well as three times, as well as four times etc. This pattern matches 78901, but it also matches 7890178923, as well as 789017892378945, etc. all the way up to 7890178923789457896778989.

(a)(a)(a)...

Beware: A pattern with no accumulators but having constants and a loop matches infinitely many numbers. This one matches 111, 111111, 111111111, etc.

Rules

Input can be given in any reasonable format, so long as each token type is clearly distinct, clearly delimited, and consistent. This includes lists of characters, lists of strings, lists of numbers, a single string, curried arguments, etc.

The loop token in particular can be taken anywhere in the input convenient, including separate from all of the other tokens. e.g. you could take it as a separate boolean input, or a command line argument, or at the beginning of the string instead, etc.

Standard sequence rules apply, so you can either output all matches, or take another number n as input and return the nth matching number, etc. Whatever the rules in the tag allow is fine with me.

You may assume any/all of the following:

• All patterns given have at least a single valid match.
• When given a pattern with finitely many matches, you will not be given an input asking you to exceed that amount of matches (so you wont be asked to generate the 11th number that matches (a)).
• Constant variable names first appear in some specific order. So you could, for example, accept (a)(b)(c)(a)(c) but ignore (x)(y)(z) and (c)(b)(a). So long as at least one equivalent form is allowed, it's fine. I doubt this helps anyone, just covering my bases.
• Not strictly an assumption, but you are allowed to ignore 0 as an output number or assume no input will ask for it, as it technically breaks the "no leading zeros" rule. Edge cases wouldn't add much to the challenge :P

Finally, this is code-golf, so shortest code in bytes wins.

Examples

Examples will be given as a pattern, followed by a natural n, followed by the nth matching number (including 0), 0 indexed, all delimited with |.

Still work in progress, the ?s are temporary,

(a)          |   1 | 1
(a)          |   9 | 9
(a)(b)(c)    |   0 | 102
(a)(b)(c)    |   1 | 103
(a)(b)(c)    |   7 | 109
(a)(b)(c)    |   8 | 120
(a)(b)(c)    |   9 | 123
(a)(b)(c)    |   ? | 987
(a)(b)(c)... |   ? | 987
(a)(b)(c)... | ?+1 | 102102
(n+)         |   1 | 1
(n+)         |   9 | 9
(n+)...      |   1 | 1
(n+)...      |   9 | 9
(n+)...      |  10 | 12
(n+)...      |  11 | 23
(n+)...      |  17 | 89
(n+)...      |  18 | 123
(n+)...      |  19 | 234
(n+)...      |  24 | 789
(n+)...      |  25 | 1234
(n+)...      |  26 | 2345

Meta

Should I allow leading zeroes in interest of reducing edge cases?

Answer 2

Move n, out n

Your task is to write a code, where if you move n adjacent characters, the program has to output n.
The code has to work for all integer n's \$0 \le n < \text{code-size}\$
The winning-criteria is code-golf

Rules

• Code length has to be greater than 1
• You can choose which substring to move for each n
• Code size is not measured by bytes (ofc), but by the number of characters

Example Program

abcd

abcd -> 0
bcad -> 1 (Move a)
acdb -> 2 (Move cd)
bcda -> 3 (Move bcd)

Answer 3

Find The Average String

Answer 4

Make a super fair number

An even distribution number is a number such that if you select any of it's digits at random the probability of it being any particular value (e.g. 0 or 6) is the same, \$\frac1{10}\$. A precise definition is given later on.

Here are a few examples:

• \$\frac{137174210}{1111111111} =0.\overline{1234567890}\$ is an even distribution number.
• \$2.3\$ is not an even distribution number since 7 of the digits 1456789 never appear and all but two of the digits are 0.
• \$1.023456789\$ may look like it's an even distribution number, but for this challenge we count all the digits after the decimal point, including all the 0s. So nearly all the digits are 0, and the probability of selecting anything else is \$0\$.

Precisely speaking if we have a sequence of digits \$\{d_0^\infty\}\$ then the "probability" of a particular digit \$k\$ in that sequence is:

\$ \displaystyle P(\{d_0^\infty\},k) = \lim_{n\rightarrow\infty}\dfrac{\left|\{i\in[0\dots n], d_i=k\}\right|}{n} \$

That is if we take the prefixes of size \$n\$ and determine the probability that a digit selected uniformly from that prefix is \$k\$, then the overall probability is the limit as \$n\$ goes to infinity.

Thus an even distribution number is a number where all the probabilities for each \$k\$, converge and give \$\frac1{10}\$.

Now a super fair number is a number \$x\$ such that for any rational number \$r\$, \$x+r\$ is an even distribution number.

Task

Output a super fair number. Since super fair numbers are irrational you should output as an infinite sequence of digits. You can do this using any of the sequence defaults.

This is code-golf so the goal is to minimize the size of your source code as measured in bytes.

open-ended-function

Answer 5

Implement String Projection

Answer 6

Answer 7

Same number list shape?

Given two lists of positive integers, decide whether the two lists can be made equal by only repeated application of any/either of these two functions:

• Multiply all numbers of one list by a positive integer constant
• Add a positive integer constant to all numbers in one list

This is code-golf, so shortest code wins.

Extra spec:

• You can assume lists will be at least three integers long.
• Both lists input will be the same length.
• Both lists will be given in strictly ascending order.
• Standard I/O and decision-problem rules apply.

Worked out example:

list a: 2 4 8
list b: 1 4 10

multiply elements of list a by 3

list a: 6 12 24
list b: 1 4  10

multiply elements of list b by 2

list a: 6 12 24
list b: 2 8  20

add 4 to elements of list b

list a: 6 12 24
list b: 6 12 24

done, return truthy

Shorter examples

1 1 1 1
3 3 3 3
true

5 10 11 14 16
2 12 14 20 24
true

10 100 1000 10000 100000
1  10  100  1000  10000
true

31   301  3001 30001 300001
1113 1131 1311 3111  21111
true

1 11 111 1111 11111
1 10 100 1000 10000
true

1 2 3 5 8  13
2 3 5 8 13 21
false

1 2 4 8 16
1 3 5 9 17
false

2 3 4 5
7 7 7 7
false

decision-problem code-golf

Meta

• Is it a dupe of are they colinear? Methinks maybe but this only has strictly ascending inputs, slope guaranteed to be on (0,inf) exclusive, and arbitrarily many "points".

• Better title? This was initially going to emphasize the fact that the allowed transforms don't alter the ratios of differences between numbers, but idk if it's relevant with this new phrasing

• Ascending order? Is this assumption necessary/would the challenge be better without it maybe?

• Any better falsy examples? I can't think of any other significant ones, probably will have to wait til post when people are all like "suggested test case:"

Answer 8

code-challenge

When to give up and start again

Consider the following setup. An evil wizard has ten opaque boxes in front of him. Hidden from you, he chooses a random number of coins \$x \in \{1 \dots 10\}\$ and spreads them uniformly at random in the boxes. That is, there should be equal probability of assignment of coins to boxes from all possible assignments of \$x\$ coins to 10 boxes. If you can prove that in fact there are \$x=10\$ coins hidden in the boxes the wizard will grant you a wish.

In this game, you can look inside one box at a time chosen by you. When you do that, you can see how many coins there are in that box.

However the wizard, being evil, will never let you look in box 10. This might still be ok as you might find 10 coins in the other boxes and in fact the only way to be granted the wish is to have found all 10 coins in the first 9 boxes.

Unfortunately, the wizard does not let you play the game for free. It costs you one dollar to look in box 1, two dollars to look in box two, four in box three, doubling each time up to 256 dollars for box 9. Remember, you can never look in box 10.

The wizard has one last twist for you. At any point, you can choose to give up on this set of boxes and get him to start the whole process again (with a new random \$x\$). Of course, if you have looked in all the 9 boxes and you still have not found 10 coins you have no choice but to give up and start again. But you might want to give up earlier too. Sadly you never get any money back so your costs just carry on building.

Your goal is to devise a strategy that will get you the wish at the minimum expected cost. You should report your mean cost.

Testing

Once you have chosen your strategy, you should run it until you get the wish 10,000 times and report the mean cost. If two answers have the same strategy, the one posted first wins. If two strategies have similar mean costs you may need to test it 100,000 or even more times to tell the difference.

Answer 9

Solve the Greek Computer Puzzle Toy

Posted live: Solve the Greek Computer Puzzle Toy

Answer 10

Find "Millionaire" score

code-golf string

I was looking through the uploads of GAMES Magazine to archive.org, and in the first publication I found a challenge called "Millionaire: a word-and-number prize competition".

In this game, each word is assigned a score in the following way:

1. Turn each letter in the word into a number: A becomes 1, B becomes 2, C becomes 3, and so on.
2. Multiply the numbers.

For example, the score for BED is \$2*5*4 = 40\$.

(In the competition, the goal was to find the word whose score is closest to a million, but that's not relevant here.)

The challenge

Given a word (i.e. a sequence of uppercase letters) as an input, output its score.

Test cases

Input	Output
A	1
Z	26
BED	40
CHAIR	3888
BOTTOM	2340000

Questions

This challenge is probably not new -- please let me know what it's duplicating. I could make the challenge something like "given a list of words, find the word whose score is closes to a million", but I think that's particularly uninteresting.

Answer 11

Make a Brainfuck Interpreter

Answer 12

Optimally pop all the bubbles

Answer 13

Render a triangle in vulkan

vulcancode-golf

The vulkan API is famous for requiring graphic engines to be very verbose (usually at least 1000 lines of code for a basic result). I am curious to see how far we can escape this trend.

Task

Using vulkan and no other rendering API, have a triangle rendered to screen with a color pattern as seen in this image: For rendering to screen, some extensions are needed. You should use the minimal number of extensions and layers necessary.

Points are counted as the number of bytes of the program file plus number of bytes of shader files if needed.

You can take whatever shortcuts you want as long as it runs on your machine. You should provide a screenshot of the result as a minimal kind of proof.

Hints

• As a reference implementation you can check the vulkan tutorial. The code of 15_hello_triangle.cpp is 34536 bytes, and it uses two shaders of 389 and 158 for a total of 35 083 bytes. The c++ code is contained in a single file but this is far to be an optimal solution.
• You can assert the running machine will be yours and skip all the property checks for devices, queues etc.
• Well known window creation libraries such as GLFW or SDL are authorized.
• You can use existing Language bindings to provide a solution in you favorite language.

Answer 14

Posted

Answer 15

Guess the Caesar cipher shift

test-battery cipher string

A Caesar cipher is a cipher which takes a message and an integer \$n\$ between 0 and 25 (inclusive). Each letter in the message is then "shifted over" in the alphabet by \$n\$ letters, wrapping around the beginning of the alphabet. For example, when \$n=1\$, A becomes B, B becomes C, and so on, up to Z which becomes A. (Uppercase/lowercase is kept the same and punctuation is ignored.)

The challenge

Given a string which represents a message encoded using a Caesar cipher with some shift \$n \in [0,25]\$, output a guess for \$n\$. (You can decide whether punctuation is included or stripped ahead of time.) For example, if you take the word Happy code golfing! and encode it using a Caesar cipher with a shift of 3, you get Kdssb frgh jroilqj!. So if your program takes in Kdssb frgh jroilqj!, it should output 3. Your solution should be deterministic -- e.g. no random number generators.

Scoring

To find the score of your function, it should be tested on every paragraph in Pride and Prejudice¹ and every possible shift value (from 0 to 25). Here's a link to a text file with each paragraph on a single line, and here's an alternate version where the quote marks have been replaced with ASCII alternatives. There are 2074 paragraphs, so there are \$26*2074 = 53924\$ test inputs. Your score is equal to

$$s(b,p)=(1+\sqrt{b}) (1+\sqrt{p})-1$$ $$b = \text{number of bytes}$$ $$p = \text{proportion incorrect} = 1-\frac{\text{number of test inputs correct}}{53924}$$

so, for example, a 100 byte program that got 13481 tests correct (i.e. \$\frac34\$ of them incorrect) would have a score of \$(1+\sqrt{100})(1+\sqrt{\frac34})-1 = 15.5\$.

Your goal is to minimize your score.

Here's a link to some Python code, which can be run online, containing a test harness, along with a baseline program to which you can compare your answer. In this case, I've opted to remove all punctuation before parsing each line. For reference, this function is 89 characters and gets 40144/53924 tests correct, so its score is 14.70850917.

Test cases

Input	Output
Hs hr z sqtsg tmhudqrzkkx zbjmnvkdcfdc, sgzs z rhmfkd lzm hm onrrdrrhnm ne z fnnc enqstmd, ltrs ad hm vzms ne z vhed.	25
“Rk! brx duh d juhdw ghdo wrr dsw, brx nqrz, wr olnh shrsoh lq jhqhudo. Brx qhyhu vhh d idxow lq dqbergb. Doo wkh zruog duh jrrg dqg djuhhdeoh lq brxu hbhv. L qhyhu khdug brx vshdn loo ri d kxpdq ehlqj lq pb olih.”	3
“That is a question which Mr. Darcy only can answer.”	0
Vczqrsvky cffbvu ritycp, reu klievu rnrp. Yvi ivjzjkretv yru efk zealivu yvi nzky kyv xvekcvdre, reu yv nrj kyzebzex fw yvi nzky jfdv tfdgcrtvetp, nyve kylj rttfjkvu sp Dzjj Szexcvp,	17

---

¹Chosen because it's the most popular book on Gutenberg at the time of writing.

Questions

The scoring function seems like it could be gamed by writing a really short, really inaccurate function, so I'm thinking of adding a function which penalizes incorrect answers even harsher.

Answer 16

Calculate Pi unto a Point using the Nilakantha series

Answer 17

Title

God Save the Queen (or King)!

Input

A calendar year from 927 to the present year. For example 2022.

Output

You can use any three distinguishable outputs. As an example,

“K” (short for King)

or

“Q” (short for Queen)

depending on which was right in England in that year. If there was both a King and Queen in that year you can output either.

If there was no King or Queen for the whole of that year, your code must output something that is not one of those two messages.

Dates

Kings: 937-1553, 1603-1649, 1660-1702, 1714-1837, 1901-1952, 2022

Queens: 1553-1603, 1689-1694, 1702-1714, 1837-1901, 1952-2022

code-golf

Answer 18

Is there a area that can see the entire perimeter of a polygon code-golfgeometrydecision-problem

Oh no, your despotic regime has too many political prisoners and not enough guards! Time for drastic measures: Only build prisons that require only a single guard. But there are many prison design and little time. How to check?

The challenge

Given a polygon, as a list of points, determine if there is a area (where the guard can stand) that can see the entire perimeter of the polygon.

Any convex shape trivially qualifies:

Some concave shapes qualify too:

But not all:

Algorithm hint

The area where a guard can stand is the intersection of the areas on the inside of the tangent of every edge.

Test Cases

Image	Points	Outcome
	TBD

Answer 19

Calculating Pi using the Gregory-Leibniz series unto a point

Answer 20

Construct Digit From Digits

In the game All Ten, each day you are given four single-digit positive integers, and have to use all four of those numbers once each to construct the values 1 through 10 using the following operations:

• Addition
• Subtraction
• Multiplication
• Division
• Concatenation, i.e. joining two numbers together; for example, \$1 \text{ concat } 23 = 123\$. (You can only apply this operation if both of the numbers are integers and the number on the right is non-negative.)

So, for example, given numbers \$[4,4,8,9]\$, to make \$4\$ you could do \$((4 \text{ concat } 4) - 8 ) / 9\$. which equals \$(44 - 8)/9 = 36 / 9 = 4\$.

You're allowed to compose these operations however you want, in whatever order, including concatenation (e.g. you can do \$16 - ((2-1) \text{ concat } 3) = 16 + (-1 \text{ concat } 3) = 16 - 13 = 3\$.)

The challenge:

Your function is given two inputs: \$I\$, which is a list of four single digit positive integers (i.e. in the range \$1,2,\ldots,9\$) which are not necessarily unique, and \$n\$, which is also a single digit positive integer.

Your function should return a way of using all four numbers in \$I\$ to construct \$n\$ using the rules above.

Output Format

You can provide the output in any meaningful way, including:

• A string (or list of numbers/characters) representing the expression which evaluates to \$n\$, using any symbols besides \$1,2,\ldots,9\$ to represent the operations / parentheses necessary
  • e.g. "((4c4)-8)/9"
  • You're also allowed to represent concatenation with the empty string (i.e. no operator at all) -- e.g. "((44)-8)/9"
  • You can leave out parentheses if you specify the order of operations -- e.g. you say that concatenation has highest priority, then return "(44-8)/9"
• A tree or nested list with where each leaf represents a number in \$I\$ and the parents represent the various operations

You may assume there is at least one solution; if there's more than one solution, you may output any of them.

Test cases

[To do -- I need to enumerate all of the possible ways to construct a given value for this to be useful.]

Questions

This is a really bad title, but it's hard to describe succintly. There's also a lot of text here, but I don't know how to shorten it.

Answer 21

Create a nibble shorthand

Answer 22

Longest alternating subsequence

Answer 23

Partition square into squares

Given integers \$n\$, \$m\$ and \$k\$, randomly output a list of \$k\$ numbers between \$1\$ and \$m\$ (inclusive) such that the sum of the squares of the numbers in the list is equal to \$n\$ squared. In other words, find a way to randomly split \$n^{2}\$ into \$k\$ squares between \$1\$ and \$m^{2}\$.

If there is no solution (which may happen if \$k = 2\$), you may exit from your program or return an error.

The program should take less than 40 seconds for inputs with \$k, n, m\$ less than 10000.

Scoring

This is code-golf, so the smallest score in bytes wins.

Input

Three numbers \$n\$, \$m\$, and \$k\$.

Output

A random list of \$k\$ numbers between \$1\$ and \$m\$, such that the sum of the squares of them is equal to \$n^{2}\$. All possible lists that satisfy the conditions should be equally likely.

Test cases

Input (n, m, k)      Possible output
114, 100, 6          [13, 1, 25, 76, 44, 67]
114, 100, 6          [64, 58, 20, 32, 64, 4]
57, 40, 7            [2, 32, 18, 26, 26, 17, 16]
7, 10000, 2          [error]
7, 7, 3              [2,3,6], [2,6,3], [3,2,6], [3,6,2], [6,2,3], [6,3,2]

Answer 24

Prime number checksum

Posted here

Answer 25

Alphabet checksum

Answer 26

Render an Ideographic Description Sequence

codegolf graphical-output unicode

There are 12 characters in Unicode that can be used to describe any CJK character, which are often made up of reoccurring parts ("radicals") composed in different ways.

For example, U+86D9 蛙 can be described as U+2FF0 U+866B U+572D ⿰虫圭.

Your task is to take such an Ideographic Description Sequence as input and produce an image of the resulting character as an output. You can assume the input conforms to the following grammar, which is taken from the Unicode standard, which explains this topic very well:

IDS := Ideographic | Radical | CJK_Stroke | Private Use | U+FF1F
    | IDS_BinaryOperator IDS IDS
    | IDS_TrinaryOperator IDS IDS IDS
CJK_Stroke := U+31C0 | U+31C1 | ... | U+31E3
IDS_BinaryOperator := U+2FF0 | U+2FF1 | U+2FF4 | ... | U+2FFA | U+2FFB
IDS_TrinaryOperator := U+2FF2 | U+2FF3

This is a kind of prefix notation (polish notation).

Ideographic and Radical are defined in PropList.txt:

2E80..2E99    ; Radical # So  [26] CJK RADICAL REPEAT..CJK RADICAL RAP
2E9B..2EF3    ; Radical # So  [89] CJK RADICAL CHOKE..CJK RADICAL C-SIMPLIFIED TURTLE
2F00..2FD5    ; Radical # So [214] KANGXI RADICAL ONE..KANGXI RADICAL FLUTE

3006          ; Ideographic # Lo       IDEOGRAPHIC CLOSING MARK
3007          ; Ideographic # Nl       IDEOGRAPHIC NUMBER ZERO
3021..3029    ; Ideographic # Nl   [9] HANGZHOU NUMERAL ONE..HANGZHOU NUMERAL NINE
3038..303A    ; Ideographic # Nl   [3] HANGZHOU NUMERAL TEN..HANGZHOU NUMERAL THIRTY
3400..4DBF    ; Ideographic # Lo [6592] CJK UNIFIED IDEOGRAPH-3400..CJK UNIFIED IDEOGRAPH-4DBF
4E00..9FFF    ; Ideographic # Lo [20992] CJK UNIFIED IDEOGRAPH-4E00..CJK UNIFIED IDEOGRAPH-9FFF
F900..FA6D    ; Ideographic # Lo [366] CJK COMPATIBILITY IDEOGRAPH-F900..CJK COMPATIBILITY IDEOGRAPH-FA6D
FA70..FAD9    ; Ideographic # Lo [106] CJK COMPATIBILITY IDEOGRAPH-FA70..CJK COMPATIBILITY IDEOGRAPH-FAD9
16FE4         ; Ideographic # Mn       KHITAN SMALL SCRIPT FILLER
17000..187F7  ; Ideographic # Lo [6136] TANGUT IDEOGRAPH-17000..TANGUT IDEOGRAPH-187F7
18800..18CD5  ; Ideographic # Lo [1238] TANGUT COMPONENT-001..KHITAN SMALL SCRIPT CHARACTER-18CD5
18D00..18D08  ; Ideographic # Lo   [9] TANGUT IDEOGRAPH-18D00..TANGUT IDEOGRAPH-18D08
1B170..1B2FB  ; Ideographic # Lo [396] NUSHU CHARACTER-1B170..NUSHU CHARACTER-1B2FB
20000..2A6DF  ; Ideographic # Lo [42720] CJK UNIFIED IDEOGRAPH-20000..CJK UNIFIED IDEOGRAPH-2A6DF
2A700..2B739  ; Ideographic # Lo [4154] CJK UNIFIED IDEOGRAPH-2A700..CJK UNIFIED IDEOGRAPH-2B739
2B740..2B81D  ; Ideographic # Lo [222] CJK UNIFIED IDEOGRAPH-2B740..CJK UNIFIED IDEOGRAPH-2B81D
2B820..2CEA1  ; Ideographic # Lo [5762] CJK UNIFIED IDEOGRAPH-2B820..CJK UNIFIED IDEOGRAPH-2CEA1
2CEB0..2EBE0  ; Ideographic # Lo [7473] CJK UNIFIED IDEOGRAPH-2CEB0..CJK UNIFIED IDEOGRAPH-2EBE0
2F800..2FA1D  ; Ideographic # Lo [542] CJK COMPATIBILITY IDEOGRAPH-2F800..CJK COMPATIBILITY IDEOGRAPH-2FA1D
30000..3134A  ; Ideographic # Lo [4939] CJK UNIFIED IDEOGRAPH-30000..CJK UNIFIED IDEOGRAPH-3134A
31350..323AF  ; Ideographic # Lo [4192] CJK UNIFIED IDEOGRAPH-31350..CJK UNIFIED IDEOGRAPH-323AF

Rules

Keep in mind that output has to be an image, not a unicode character, as per the default loophole, but I recommend a text rendering engine to render each radical.

You can assume the input won't contain private use characters.

Use the following definitions of the Ideographic Description Characters. The percentages are not defined in unicode, but made up for this challenge. Each component should be squashed to the required shape, so that each intermediate result is a square. The output should also be a square image. See also: https://en.wikipedia.org/wiki/Chinese_character_description_languages#Ideographic_Description_Sequences

Code point	Character	Meaning
U+2FF0	⿰	divide horizontally in halves
U+2FF1	⿱	divide vertically in halves
U+2FF2	⿲	divide horizontally in thirds
U+2FF3	⿳	divide vertically in thirds
U+2FF4	⿴	enclose; the lengths should be 20%, 60%, 20%
U+2FF5	⿵	surround from top; the inner has 60% the width and 80% of the height
U+2FF6	⿶	surround from below; the inner has 60% the width and 80% of the height
U+2FF7	⿷	surround from left; the inner has 80% the width and 60% of the height
U+2FF8	⿸	surround from top-left; the inner has 80% the width and height
U+2FF9	⿹	surround from top-right; the inner has 80% the width and height
U+2FFA	⿺	surround from top-right; the inner has 80% the width and height
U+2FFB	⿻	overlay with transparency

Examples

Input	Output
虫	虫
鬱	鬱
⿰虫圭	蛙
⿲彳圭亍	街
⿵几皇	凰
⿻工从	巫
⿴囗⿰⿱鹵凼⿰丨㇌
⿱井蛙
⿱井⿰虫圭
⿱井⿰虫⿱土土

Answer 27

Increment, decrement, undo, peek

Answer 28

Length of Binary as Base 10 [OEIS A242347]

Answer 29

Power sequence differences

Answer 30

Longest Total Distance Cyclic Quine Chain code-challengequinebusy-beaver

Write a program of upto 100 bytes that outputs another program that outputs another program etc. until after a finite number of iterations outputting the original program again.

Each program in the cycle must have a length less than or equal to 100 bytes.

Your score is the sum of the Levenshtein distance between each program and it's output. I hope this leads to answers that do something more creative than change a single digit each time.

Maximum possible score is: $$256^{101}$$