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

Compare Multiratios

EDIT: No doesn't make any sense, I need to think about it again.

Answer 2

Smallest self-hosting golfing language code-golf

Implement a golfing language that is implemented in itself. Formally speaking: The original compiler O (an executable file assumed to be implemented in other language X), when given its own source code S (in golfing language G), must produce the identical executable file O. Your task is to create G by implementing O.

Language X might be an ELF binary, x86 assembly, Python, LLVM IR, etc.

Neither your language implementation S or executable file O may use functions that have the same functionality as exec or eval. That is, you may not use any built-in code evaluation of your compiler O. Standard Quine loopholes, such as reading your own file, downloading your file from the internet, and holding the program data in the filename, are not allowed.

The executable file O of the compiler must not be embedded in any shape or form in the source code S of the compiler. Additionally, the source code S of the compiler must be strictly shorter than the executable file O.

Your code must not be dependent on any external program or internet resource other than language X: if your language is dependent, include the size of the external dependencies in your submissions. Your program gets a standard POSIX system base for free, plus GCC 8 and LLVM 10: you do not have to include the size of this in your submission. For example, if you submitted a Bash Quine that just invoked the 05AB1E interpreter via the command line, you would have to include both the size of the the 05AB1E implementation, as well as the size of the Elixir implementation (since 05AB1E is implemented in Elixir and your base language X isn’t Elixir) in your bytecount.

In addition, standard golfing loopholes apply.

Requirements

Answer at least 10 other code-golf challenges on this website, beating at least 50% of the existing answers in byte size.

• Only challenges that already have 4 answers are allowed
• Your own other answers to the challenges do not count
• Challenges newer than this post are allowed, as well as answering your own challenges; provided they already have 4 answers from other answerers
• Link to your challenge answers for verification

Base language X restrictions

Language X must have an implementation, in other words we must be able to actually run your compiler O with source code S and get compiler O as output.

Language X must have already existed before this post was created.

You are encouraged to share the techniques of how you created your compiler and how you came up with your golfing language.

Scoring

$$S*0.98^{(n-10)}$$ where n is the number of challenges where you beat at least 50% of the other answers, not including your own.

---

Feedback

How can you prevent someone submit a zero bytes answer and claim: if source is empty, it output the interpreter, otherwise output compiled python code. – tsh Aug 24 at 4:42

Answer 3

DRAFT: Remove vertical comments code-golf

Vertical commnets...

        /> push back with    result.cows_used.push_back(possiblecow);
        the new cow added </ cows_used.push_back(result.cows_used);

Traditional comments...

        /* push back with */ result.cows_used.push_back(possiblecow);
     /* the new cow added */ cows_used.push_back(result.cows_used);


        result.cows_used.push_back(possiblecow);
        cows_used.push_back(result.cows_used);

Annotated, everything with . is considered a comment:

        />.................. result.cows_used.push_back(possiblecow);
        ..................</ cows_used.push_back(result.cows_used);

What is both between the start row of /= and the end row of =/ and between the start column of /= and the end column of =/ is considered a comment.

        /> push back with       result.cows_used.push_back(possiblecow);
           the new cow added </ cows_used.push_back(result.cows_used);

---

Todo

• Add testcases

Answer 4

Breaking the Wordbuilder (canned)

Dupe of Let's Play Countdown! ... oh well. Thanks for the feedback everyone.

Answer 5

I see your BIDMAS and raise you a BADMIS

Challenge

Given a set of numbers with operators between them: "5 + 4 * 9 / 3 - 8", return all the possible results of the expression for every permutation of the order of basic operations: [/, *, +, -].

Rules

• Standard loopholes forbidden
• I/O
  • Input must be ordered with infix operations, but however that is easiest (string or array)
  • Output must be all of the possible results of the expression, no specified format or order, no repeats
• All of the inputs are valid (e.g. do not need to deal with "7 / 3 + *"
• Operators are all left-associative so "20 / 4 / 2" = "(20 / 4) / 2"
• This is Code Golf so fewest number of bytes wins

Test Cases (With explanation)

• "2 + 3 * 4" = [14, 20]
  • 2 + (3 * 4) ⟶ 2 + (12) ⟶ 14
  • (2 + 3) * 4 ⟶ (5) * 4 ⟶ 20
• "18 / 3 * 2 - 1" = [11, 6, 2, 6]
  • ((18 / 3) * 2) - 1 ⟶ ((6) * 2) - 1 ⟶ (12) - 1 ⟶ 11
  • ((18 / 3) * (2 - 1) ⟶ (6) * (1) ⟶ 6
  • (18 / (3 * 2)) - 1 ⟶ (18 / (6)) - 1 ⟶ (3) - 1 ⟶ 2
  • 18 / (3 * (2 - 1)) ⟶ 18 / (3 * (1)) ⟶ 6

Test Cases (Without explanation)

• "45 / 8 + 19 / 45 * 3" = [5.765740740740741, 0.01234567901234568, 0.11111111111111113]
• "2 + 6 * 7 * 2 + 6 / 4" = [154,113.5,88]

Answer 6

The Rattlin' Bog

There's a relatively famous Irish Folk song called The Rattlin' Bog, a type of cumulative song.

Basically, this is a song that alternates between a chorus and an ever-expanding verse

The chorus is as follows:

Ho, ro, the rattlin' bog
The bog down in the valley-o
Ho, ro, the rattlin' bog
The bog down in the valley-o

Each verse starts with
And on that [x] there was a [y]
A rare [y], a rattlin' [y]

and ends with
In the bog down in the valley-o

Where x is the word from the previous round, and y is the word for the current round. In between these two is the cumulative part. It starts with:
The [z] in the bog

Each new round adds
The [y] in the [x] and
To its predecessor.

Challenge

Given a list of strings, character arrays, or whatever reasonable equivalent collection of string or your language equivalent thereof, Your job is to print the lyrics to the song, alternating between the chorus and each verse, starting and ending with the chorus. The chorus and verse must be separated by a pair of newlines.

For the sake of brevity, you may write the chorus once, preceded by "[Chorus]" then write "[Chorus]" in place. I'm also omitting any sort of final verse with unique text.

Example:

Input: [House, Roof, Nest] 
Output:
[Chorus] 
Ho, ro, the rattlin' bog 
The bog down in the valley-o 
Ho, ro, the rattlin' bog 
The bog down in the valley-o  

And on that bog there was a House
A rare House, a rattlin' House
The House in the bog
In the bog down in the valley-o

[Chorus]

And on that House there was a Roof
A rare Roof, a rattlin' Roof
The Roof in the House and the House in the bog
In the bog down in the valley-o

[Chorus]

And on that Roof there was a Nest
A rare Nest, a rattlin' Nest
The Nest in the Roof and the Roof in the House and the House in the bog
In the bog down in the valley-o

[Chorus]

Answer 7

Sliding window minimum code-golf restricted-complexity

The task is, given a number array of length n and a positive integer k, to compute the smallest values in all its overlapping consecutive subarrays of length k in the order they occur.

The complexity of your program should be no more than linear with respect to n with a constant added.

Input

A positive integer array of length n and a positive integer k (k <= n)

Output

A positive integer array with n - k + 1 elements, where the element at position i equals the least number in the subarray starting at i and ending at i + k - 1 inclusive.

Examples

[1, 3, 5, 7], 2 -> [1, 3, 5]
[1, 3, 5, 3, 5, 1], 3 -> [1, 3, 3, 1] 

TODO

Sandbox stuff

• Is it acceptable to combine code-golf with restricted-complexity?
• Is the complexity restriction clear enough?
• Is it a good idea to allow calculating the maximum instead of the mininum?
• Is the grammar correct enough?
• Has this been posted before?
• Do any languages have built-ins for this?

Answer 8

Random point on a sphere

Posted here

Answer 9

Consequence Golf

code-golfgolf

As specified by this xkcd, Consequence Golf is a game involving golfing and bombs. The most obvious consequence of bombs: damage to the course.

A Consequence Golf course consists of the union of several circular regions. The tee is located at (0, 0). On each turn, you hit the ball bomb in a direction at some power. The bomb will travel in that direction for a distance equal to the power of the shot, unless it hits the edge of the course, in which case it will explode immediately. When a bomb explodes, it adds to the course a new circle centered on the point of contact with a radius equal to the remaining power. The next shot starts at the last location of the bomb.

Input

• A list of circles, consisting of x/y coordinates and a radius for each circle, taken in any convenient format. If you must define a custom data type to store this information (e.g. struct c{float x,y,r};), you do not need to count that added boilerplate, nonproductive storage code in your byte count. Any code that does something besides specify storage must be counted.
• A list of strokes, consisting of an angle in radians or degrees, and a power, again in any convenient format.

Output

• The location of the bomb after the final stroke.

Additional Rules

• The course will always contain at least one circle
• The course will always contain the tee at (0, 0)
• If there are zero strokes, you must return (0, 0)
• The power of a stroke will never be zero
• "Any convenient format" means a list of lists, list of C structs, a list for each input (x, y, radius, power, angle), or similar. You may not take information that is not as it is specified. For example, you may not take the circles as a series of equations.
• This is consequence code golf, so shortest code in bytes wins.

Test cases

TBD...

Questions for META:

• Is the description of how to play Consequence Golf clear enough?
• Is the description of the input clear enough? This is my main concern.
• Is allowing boilerplate storage code outside of the byte count an issue?
• I am considering allowing fixed point approximations with at least 4 bits of precision for languages without floating point (and languages with, if it somehow makes things shorter). Would this cause any unintended issues?

Answer 10

Posted to PPCG

Answer 11

Encode MC6000 instructions

In MC6000, these are registers list:

acc  general
dat  general
p0   simple pin
p1   simple pin
x0   XBus pin
x1   XBus pin
x2   XBus pin
x3   XBus pin
null pseudo

where general means reading from it returns the last value written to it, XBus pin means reading from or writing to it have side effect(so teq x0 x1 doesn't equal to teq x1 x0) that nothing else can take its place, simple pin means reading from it also writes zero to it(so mov 0 p0 equals to mov p0 null), writing anything to it(including the writing while reading) have side effect, and writing anything larger than 100 behaves same as writing 100, as well as writing anything smaller than 0 same as writing 0(so mov -4 p0 equals to mov 0 p0). Writing anything into null has no effect and reading from null returns 0(so mov 9 null equals to nop).

The instruction set is:

nop            Do nothing
mov R/I R      operand2:=operand1
jmp L          Jump to the specified line(can't be replaced)
slp R/I        Sleep for the number of time units specified by the operand.
slx XP         Sleep until XP avaliable(can't be replaced)
add R/I        acc:=f(acc+operand)
sub R/I        acc:=f(acc-operand)
mul R/I        acc:=f(acc*operand)
not            acc:=100(if acc was 0) or 0(otherwise)
dgt R/I        acc:=(acc/10^operand)mod 10(if operand in 0,1,2) or 0(otherwise)
dst R/I R/I    acc:=[abs(acc-[(acc/10^operand1)mod 10]*10^operand1)+abs(operand2 mod 10)*10^operand1]
               *sgn(operand2*2+1) (if operand1 in 0,1,2) or acc(otherwise)
teq R/I R/I    sym:='+'(if operand1 equals to operand2) or '-'(otherwise)
tgt R/I R/I    sym:='+'(if operand1 is larger than operand2) or '-'(otherwise)
tlt R/I R/I    sym:='+'(if operand1 is smaller than operand2) or '-'(otherwise)
tcp R/I R/I    sym:='+'(if operand1 is larger than operand2),
               '-'(if operand1 is smaller than operand2) or '*'(otherwise)
gen SP R/I R/I Output 100 and 0 to the simple pin for the latter two operands, inclusive

Here R/I means a register or an integer between -999 and 999, inclusive; R means a register, L means an integer between 0 and 13, XP means an XBus pin, and SP means a simple pin. f(x) is defined as min(999,max(-999,x)). Sleeping for zero or negative time units sleep for time as long as a nop(so nop=slp 0=slp -3).

Before an instruction, symbol +, - and @ can exist, meaning that the instruction is executed only if sym is +, - and @, inclusive. (@ doesn't work like this in fact but that doesn't affect this problem) Whether the instruction is executed matters even if it's a no operand(so + nop doesn't equal to - nop, but + nop equals to + tgt 1 0).After an instruction, comment start with # can exist, which can be ignored. Spaces work as separator, and can be added or removed as long as words are separated in the same way(continious spaces, spaces at both side).

---

Now, write a program A that, reads an instruction and output an integer; and write a program B that reads the output of program A and output an equal or same instruction fed into program A.

Your score will be the sum of length of program A, length of program B, and difference between the maximum and minimum of output of A. Lowest score in every language win.

Using MetaGolfScript is allowed. Only write MetaGolfScript in language area and show the exact version you use in code area to make it leaderboard friendly.

Answer 12

Tiling string

(inspired by the tiling pattern effect tipic of the texturing of landscapes. This question I would like to ask is not exactly the same thing but close to it, or at least it was the idea)

Given a string S check if it has some repeating tile pattern and prove it providing at least one repeating pattern.

A substring tile pattern is a pattern of any form which repeats inside the string where one or more(alpha case insensitive) chars forms a fixed structure that can contain also others generic chars(all printable ascii table set)

the output will be false,0,f or any meaningful negative expression if no tiling occours. true,1,... plus at least one repeating tile pattern instead.

for example :

 they were obsessed by the sessions
             s#ss          s#ss
 outputs : true s#ss



look at that truck
      t$t  t$t
outputs: 1,t$t


- case insensitive. 
- only letters matters as tile pattern.   
- if two letters are separated by space or every non letter char they still form a pattern.  
- overlaps doesnt make tiling effect.
- a pattern must contain half or more structure chars and must be len>1 to be considered, and must be repeated at least two times.

example

"Hello world!"=> false or 0 or f or no

"aa"=>false.
aaa=>false. "aaaa"=> true(aa)
"aabbabab"=>true:ab,ba or 1 ab ba. or yes[ba,ab] or...any reasonable format

This is code-golf so shortest answer wins

Answer 13

Observability and controllability

code-golf linear-algebra decision-problem

Background

Note: if you like, you can skip this part, and simply implement the suggested algorithm.

When looking at dynamic systems, there exist the notions of observability and controllability. They are the answers to the questions

• Observability: can we know all the internal states of a system by looking only at the given outputs?
• Controllability: can we influence all the internal states of a system by changing only the inputs?

For the sake of this question, we will only look at LTI (linear time-invariant) systems, either in continuous or discrete time. During the rest of the question, I will only present the case of a state-space representation of the system and suggest using the observability- or controllability Gramian, but you may use any other algorithm to decide the controllability and observability of the given LTI system.

Input

You are given an LTI system, $$ \mathbf{\dot{x}}(t) = A\mathbf{x}(t) + B\mathbf{u}(t)\\\mathbf{y}(t)=C\mathbf{x}(t)$$ where \$A\$, \$B\$ and \$C\$ are matrices containing only integers. The dimensions of these matrices are \$\dim{A}=n \times n\$, \$\dim{B} = n \times p \$ and \$\dim{C} = q \times n\$ with \$n\$, \$p\$ and \$q\$ positive integers.

A suggested input method would be to simply input these matrices, but you may also take input as function objects, string representations of differential equations, or transfer functions.

Output

You must output two thruthy/falsy values, one indicating whether the system is controllable, and one indicating whether the system is observable. Order does not matter but must always be the same. Alternatively, you may have four distinct outputs (e.g., the integers 0, 1, 2, 3) each corresponding to a possible combination of controllability/observability.

Suggested algorithm

To decide on observability and controllability, you can calculate the so-called observability Gramian (a square matrix), $$\begin{bmatrix}C & CA & CA^2 & ... & CA^{(n-1)}\end{bmatrix}^T$$ and controllability Gramian $$\begin{bmatrix}B & AB & A^2B & ... & A^{(n-1)}B\end{bmatrix}$$ The system is observable iff the observability Gramian is invertible. The system is controllable iff the controllability Gramian is invertible. There are many ways to check if a matrix is invertible; an obvious way would be to check if the determinant equals zero.

Testcases

Coming soon, because I want to include worked examples.

Answer 14

Posted

Answer 15

Smallest put pixel function

Task: write in any language which can generate images e.g. JavaScript, the smallest "put pixel" function. You can initialise screen inside that function or in separate code. The put-pixel function should consume 6 arguments: x,y,r,g,b,a where x,y pixel coordinates and r,g,b,a are color values (a is for alpha - transparency - you need blend new color with old color). Provide also example which use that function a draw something.

Answer 16

Shuffling Sequence

code-golf number sequence

Consider an operation \$f_n\$ that takes a length-\$2n\$ list and performs a perfect shuffle on it, reversing the second half. For example, \$f_4 [abcdABCD] = [aDbCcBdA]\$.

Under composition, \$f_n\$ generates a cyclic group. That is, there exists some minimal positive integer \$m\$ such that \$(f_n)^m\$ (which means \$f_n\$ composed \$m\$ times with itself) is an identical map, leaving its argument alone. Here's an example for ya:

$$f_2 [abAB] = [aBbA]$$ $$f_2 [aBbA] = [aABb]$$ $$f_2 [aABb] = [abAB]$$

$$f_2(f_2(f_2 [abAB])) = (f_2)^3 [abAB] = [abAB]$$

Since \$(f_2)^3\$ is the identity, we say that \$f_2\$ has order 3.

Your task is to determine the order of \$f_n\$. You've got a few choices for how to do this:

• Take as input \$n\$ and provide as output the order of \$f_n\$
• Take as input \$n\$ and provide as output the order of each \$f_k\$ for \$k < n\$ or for \$k \le n\$ (your choice)
• Output these orders indefinitely, beginning with that of \$f_0\$ or \$f_1\$ (your choice)

For reference, the first 77 terms (beginning from \$n = 1\$; you may optionally return \$1\$ for \$n = 0\$) are provided below. This is OEIS A294673.

1,3,5,4,9,11,9,5,12,12,7,23,8,20,29,6,33,35,20,39,41,28,12,36,15,51,53,36,44,24,20,7,65,36,69,60,42,15,20,52,81,83,9,60,89,60,40,95,12,99,84,66,105,28,18,37,113,30,92,119,81,36,25,8,36,131,22,135,20,30,47,60,48,116,132,100,51,155

Standard IO and loophole rules apply. This is code-golf, so the shortest program (in bytes) in each language wins! Happy golfing!

Answer 17

Golf Golf!

This is my first challenge, so please be gentle! The challenge is to write a program that will output the correct score for a layout in the card game "Golf."

The card game Golf has many variations. The house rules I use follow the standard rules for Six-Card Golf given by Pagat, with one slight difference.

Each player has a 2x3 layout of cards. By the end of each round all cards are turned face up and scored as follows:

• Each ace counts 1 point.
• Each two counts minus two points.
• Each numeral card from 3 to 10 scores face value.
• Each Jack or Queen scores 10 points.
• Each King scores zero points.
• A pair of equal cards in the same column scores zero points for the column (even if the equal cards are twos).
• Three equal cards in the same row scores zero points for the row (even if the equal cards are twos).

Input

The input can be a string or array of any kind.

Output

An integer representing the score of the Golf hand.

Examples

These use the notation A23456789TJQK.

Layout
AK3
J23

Score
7
-----------------------    
Layout
25Q
25J

Score
20
-----------------------        
Layout
T82
T8A

Score
-1
-----------------------        
Layout
QQQ
234

Score
5
-----------------------        
Layout
TJQ
QTJ

Score
60

This is code golf, so the shortest answer in bytes wins!

Answer 18

Reorder a matrix, twice

code-golf linear-algebra

You are given a square \$n \times n\$ matrix \$A\$, and a list (or vector) \$u\$ of length \$n\$ containing the numbers \$1\$ through \$n\$ (or \$0\$ through \$n-1\$). Your task is to reorder the columns and rows of the matrix \$A\$ according to the order specified in \$u\$.

That is, you will construct a matrix \$B\$ where the \$(i,j)\$-th element is the \$(u(i),u(j))\$-th element of \$A\$. You should also output the inverse of this action; that is, the (i,j)-th element of \$A\$ will end up at position \$(u(i),u(j))\$ in a new matrix \$C\$.

For example, given $$A = \begin{bmatrix} 11 &12& 13 \\ 21& 22& 23 \\ 31& 32& 33 \end{bmatrix},\quad u=\begin{bmatrix}3 & 1 & 2\end{bmatrix}$$

the output should be $$B = \begin{bmatrix}33 & 31 & 32 \\ 13 & 11 & 12 \\ 23 & 21 & 22 \end{bmatrix},\quad C= \begin{bmatrix}22 & 23 & 21 \\32 & 33 & 31 \\ 12 & 13 & 11 \end{bmatrix}$$

You may take input and output through any of the default I/O methods. You do not have to specify which matrix is \$B\$ or \$C\$, as long as you output both. You may assume \$A\$ only contains positive integers. You must support matrices up to at least size \$64 \times 64\$.

Example

===== Input =====
A =
 35     1     6    26    19    24
  3    32     7    21    23    25
 31     9     2    22    27    20
  8    28    33    17    10    15
 30     5    34    12    14    16
  4    36    29    13    18    11
u=
  3 5 6 1 4 2

==== Output =====
B = 
  2    27    20    31    22     9
 34    14    16    30    12     5
 29    18    11     4    13    36
  6    19    24    35    26     1
 33    10    15     8    17    28
  7    23    25     3    21    32
C = 
 17    15     8    10    28    33
 13    11     4    18    36    29
 26    24    35    19     1     6
 12    16    30    14     5    34
 21    25     3    23    32     7
 22    20    31    27     9     2

Answer 19

No, you don't need deep learning: AlphaGo edition

To counter the industry fad of tackling the most trivial problems with deep learning, I propose that a proof of concept be created to demonstrate that simple database queries are in fact often sufficient. To wit, I propose to demonstrate that a database query can in fact be used to do what AlphaGo does and even do it better.

The proof of concept will consist of two parts:

• A Script to create a script to create a (...) query that, given the state of a game of Go, will retrieve a move that will result in eventual victory.
• A Script to create a script to create a (...) script to initialize the database.

This is a code-golf challenge so the least total bytes wins. Some rules for the challenge:

1. You may use whatever database lets you golf best
2. There is no limit for how many recursions of running the script generated by the script are required
   1. This includes directly submitting the query and (if the universe's hard drive capacity somehow permits) the init data
3. The final init script may also be an executable-ish that connects to the database backend to populate it
4. You may either pass the game state as an argument to the query or store the state in the database (storing the state in the DB doesn't count toward your score)
5. Handicap games don't need to be accounted for.

The rules of Go are, paraphrased:

• The game is played by placing black and white stones on a 19x19 grid
• The aim of the game is to score points by surrounding open space with your stones (The edges of the board count as surrounding)
• Black plays first
• A stone is part of a group if it is orthogonally connected to a member of the group
• The empty spaces orthogonally adjacent to a group are called liberties
• A group without liberties is considered captured and is removed from the board and added to the capturing player's score
• A group that can not escape capture is considered dead, and remains on the board but will count as captured for scoring purposes
• Suiciding your own group by filling its last liberty is not allowed
• Ko rule: If a single stone is captured so that capturing the capturing stone will return the board to the immediately previous state, such second capture is illegal on the turn after the first capture.
• The game ends when both players pass, indicating that they can't improve their score by playing another stone.

kolmogorov-complexity

Answer 20

Where am I?

Given an input folder structure (i.e. a tree data structure with named nodes), and a pointer to a directory (a specific node) within that tree structure, the program should output the full path to the directory the pointer is pointing at (in linux format, so /var/log for example), without ever inspecting the name of the current node or its ancestors; only its descendants.

The rules of the challenge are the equivalent of:

"you can cd and ls but not pwd" if this was being run on a live linux files system

but I feel I should expand on that a bit regarding how it works for a tree:

• The method starts with the pointer, and it can ls to see what is contained within this directory (i.e. view the immediate child nodes in the tree structure, but not its own name)
• the method can also cd dirname into any directory (i.e. move the pointer to any immediate child in the tree from the current node), and cd .. to go to a previous directory (i.e. move the pointer to the immediate previous child in the tree)
  • cd .. leaves you in the same directory (node), if there is no parent
  • cd invalidDirNameleaves you in the same directory (node), if there is no immediate child with that name
• Any directory can contain any number of other directories, or none.
• You are forbidden to do the equivalent of cd /

Inputs

A tree-structure representing a file system and a pointer to a node in that tree

Assumptions 1. There are no duplicate folder names in the same parent folder (so ls can't return folder, folder; for example) - but there may be other folders with the same name elsewhere in the tree structure; in which case it doesn't matter which your program outputs (as it has no way of knowing which is correct) 2. ...Therefore, it may not be possible to determine which folder you started in - in which case a best-guess is fine (see examples 3, 4) 3. Symlinks and cyclical trees are not a part of this challenge - it will always be a simple parent-child tree structure - so you are always guaranteed to find the root by doing cd .. enough times.

Output

The path that the pointer was pointing at, as a string or char array (or equivalent for your language).

Scoring

code-golf scoring is used, so shortest bytes wins.

Example 1

input map: /var/ftp/in, /var/ftp/out/child, /var/etc/test/child/etc, /var/etc/test/c2/etc2, /var/etc/test/c3

input pointer points at: c2

sample working:

1. ls -> "etc2"
2. cd .., ls -> "child","c2", "c3" - three options, need to find which is correct
3. cd child, ls -> "etc2" - this doesn't match 1, so go back
4. cd .., cd c2, ls -> "etc2" - this is correct, so I know my path ends with "/c2"
5. cd .., cd .., ls -> "test" - only one folder, so I know my path ends with "/test/c2"
6. cd .., ls -> "ftp", "etc" - two options, need to find which is correct
7. cd ftp, ls -> "in", "out" - incorrect, so go back
8. cd .. -> there was only two options, so "etc" must be correct. my path ends with "/etc/test/c2"
9. cd .., ls -> "var" - only one folder, so path ends with "/var/etc/test/c2"
10. cd .., ls -> "var" - same option, so assume we're at root.
11. Output "/var/etc/test/c2"

Example 2

input map: /app/data/dir/in

input pointer points at: /app/data

Output: "/app/data"

Example 3

input map: /var, /app, /test

input pointer points at: /app

Output: "/var", "/app" or "/test" are all valid outputs.

Note that there is no way for the program to differentiate between the three folders; and so any of the three are a valid answer for the purposes of this application.

Example 4

input map: /var/etc/test, /app/etc/two

input pointer points at: /app/etc

Output: "/app/etc"

Questions

1. Does the spec make sense?

Answer 21

Title: The Liquorice All-sort

I have just invented a new sorting algorithm, which I would like you to implement in the smallest number of bytes... The Liquorice All-sort

Given that the individual sweets are (or were) named: chips, rocks, Buttons[sic], nuggets, plugs, twists, spogs (https://en.wikipedia.org/wiki/Liquorice_allsorts), we can say that:

A bag (multiset) of Liquorice allsorts is comprised of 0..n of each item chip, rock, Button, nugget, plug, twist, spog, plus a bonus of 1..2 Bertie.

Given an input of an arbitrary array characters (A-z, 0-9, space), and a bag of Liquorice allsorts, sort as follows:

For each input character, from last to first:
    Is the bag empty?
           Yes: Exit the sort
    Else, Is the input equal to a letter (case-sensitive) that is contained in the name of one or more of the sweets in the bag?
       Yes: The number of items it matches is the number of positions it moves up the list (can't move past the top of the list).
            Take a bite out of each of the used sweets, by removing the letter we used. 
            Have we used all the letters in any item?
               Yes: Remove that item from the bag
    Else: move to the bottom of the list.

Inputs

two inputs - the numbers to sort, and the list of sweet names. Both are guaranteed to be non-empty bags (sets that can contain duplicates; or an equivalent in your language), and the bags of sweets contains a minimum of one Bertie.

Outputs

The sorted numbers

Examples

1. {Bertie},{B} -> {B}
2. {Bertie},{X,B} -> {B,X}
3. {chip, rock, Button, nugget, plug, twist, spog, Bertie}, {A,B,C,k,e,r,w} -> {B,C,k,e,r,w,A} -> {B,C,k,e,r,w,A} -> {B,k,e,r,w,A,C} -> {k,B,e,r,w,A,C} -> {e,k,B,r,w,A,C} -> {e,r,k,B,w,A,C} -> {e,r,k,w,B,A,C}
4. {Bertie, rock}, {r,o,c,k,r,o,c,e} -> {r,o,c,k,r,o,c,e} -> {o,r,c,k,r,o,c,e} -> {o,c,r,k,r,o,c,e} -> {o,c,k,r,r,o,c,e} -> (remove rock from the bag) -> {o,c,k,r,o,c,e,r} -> {o,c,k,r,c,e,r,o} -> {o,c,k,r,e,r,o,c} -> {o,c,k,e,r,r,o,c}

Sandbox Questions

I really like the idea of doing something with this (I like the wordplay of bag, etc.); but I don't know if the algorithm is just too arbitrary. Any thoughts or alternatives would be appreciated!

Answer 22

Title - Fix the note

Given a musical note letter (A to G), followed by any number of accidentals (either 0..n # or 0..n b, not a combination of both); output a representation of the same note with the least possible number of accidentals.

A # means "shift the note one semitone up", and a b means "shift the note one semitone down".

All valid output notes are as follows (in order, then loops):

A A#/Bb B C C#/Db D D#/Eb E F F#/Gb G G#/Ab

So a sharp would move to the right along that list (and loop); and a flat would move you to the left.

Examples

• A -> A
• B# -> C
• Fb -> E
• A##### -> D
• Dbbb -> B
• Gbbbbbbbbbbbb -> G
• Bb -> Bb
• F# -> F#
• E## -> F#
• E# -> F

You can assume that the length of the input won't overflow your language.

Where the input has sharps, the output can also only contain 0..1 sharps; and vice-versa for flats.

This is code-golf, so shortest bytes wins. Standard rules apply

Answer 23

Title: Score my Tarok hand

Inspired by this challenge

In Slovenia (and elsewhere in central Europe), the card game Tarok is very popular. See here for a complete list of rules, but essentially it is a trick taking game, played in teams that change per round.

This challenge is a code-golf challenge, concerning the scoring of a hand, at the end of a round.

In a normal round, the game is played in partnerships. Any one player could decide the "contract" for the round, and that player (plus anyone on their team) either wins or loses the round, giving them a positive or negative score. They are known as the "Declaring team". The "Opposing team" cannot score in that round.

The input for this challenge will therefore be the Declaring team's cards, plus the contract type they bid for.

The cards

In a game of Tarok, there are 54 cards; as follows (shown as highest to lowest in each suit - names in brackets after a card are local names given to certain cards):

• Spades, Clubs: King, Queen, Knight, Jack, 10, 9, 8, 7
• Diamonds, Hearts: King, Queen, Knight, Jack 1, 2, 3, 4
• Taroks: Joker (škis), XXI (mond), XX, XIX, ... III, II, I (pagat)

The point value of the cards are as follows:

• kings, škis, XXI and I - 5 points each
• queens - 4 points each
• knights - 3 points each
• jacks - 2 points each
• all other cards - 1 points each

Scoring a hand

This is what I believe makes this challenge interesting.

• For each set of three cards in your hand, add up their values and subtract 2.
• If you end up with one or two cards left over after making the sets of three, add up their values and subtract 1.
  • So, a pair or a set of three one-point cards are both worth 1 point; but a single one-point card is worth nothing.

The total value of the pack comes to 70 card points.

In most contracts (see below), the declarer's side wins if at the end of the play they have at least 36 of the available 70 points; otherwise they lose. Because of this, the members of each team pool their cards for scoring; and so if you know the score of one team, you can calculate the score of the other.

Once the hand value has been calculated, the difference from 35 is taken (i.e. handValue - 35), and this difference is rounded to the nearest 5 points.

Contracts and Bonuses

Once the hand score is known for the declaring team, the final score is calculated based on the "contract" that was chosen at the start of the round (where "difference" is the rounded hand difference from 35, calculated above. Note this may be negative, if the opposing team got more points):

Contract Name          | Scoring (+ if contract won, - if lost)
------------------------------------------------
Three                  | difference +/- 10
Two                    | difference +/- 20
One                    | difference +/- 30
Solo Three             | difference +/- 40
Solo Two               | difference +/- 50
Solo One               | difference +/- 60
Beggar*                | 70 (fixed)
Solo without           | 80 (fixed)
Open Beggar*           | 90 (fixed)
Colour Valat Without** | 125 (fixed), no bonuses
Valat Without**        | 500 (fixed), no bonuses

With the exception of those marked, all contracts are "won" if the difference is 36 or higher; otherwise it was "lost".

* - to win the points, you must win no tricks (and therefore no cards)

** - to win the points, you must win ALL the tricks (and therefore all the cards). In this case, no other scoring bonuses are applied.

Bonus points are awarded to the declaring team, or subtracted from the declaring team if the opposing team complete the criteria. Bonuses are only awarded on contracts where the difference is taken into account. (i.e. from "Three" to "Solo One" only, in the above table)

Bonus Criteria                                | Bonus Points
-----------------------------------------------------------------------------------
Take škis, XXI and I ("the Trule") in tricks  | 10
Take all 4 kings in tricks                    | 10
Take all the tricks ("Valat")                 | 500, no other scoring is applied

(note that in Tarok, there are some actions that take place during play which give additional bonuses, such as announcing at the start of the game your intention to get a certain bonus; but as those would require more inputs to calculate, I will leave these out of this challenge.)

Some Examples

All 54 cards, any contract -> +500 points

No Cards, called Beggar -> + 70 points

king, king, king, king, škis, XXI, I, queen, queen, queen, queen, knight, knight, knight, knight, jack, jack, 1H, 2H; called "One" -> 30 points for contract + 20 points difference (hand score is 56 which is 21 different from 35, so round to 20) + 10 points kings bonus + 10 points Trule Bonus = 70 points

No cards, called "Solo One" -> -500 (opposing team got Valat bonus)

KS,8S,7S, called "Two" ->failed contract, so -30 (difference), -20 (contract), -10 (opponents got Trule bonus) = -60 points

KH, KD, škis, I, queen, queen, queen, queen, knight, knight, knight, knight, jack, jack, 1H, 2H, 7C,1D,2D,4D; called "Solo Without" = +80 points

KH, KD, škis, I, queen, queen, queen, queen, knight, knight, knight, knight, jack, jack, 1H, X, III,II,2D,KS; called "Three" = +15 difference (49-35, rounded) + 10 contract = +25

Answer 24

Spreadsheet Columns

code-golfsequencealphabetarithmetic

In most spreadsheet programs, columns go A, B, C, ... X, Y, Z. After this comes AA, AB, AC ... AX, AY, AZ, BA and so on.

Your task is to convert one of these strings in to a column number. You must support inputs up to the maximum length of your language, to a minimum of 3.

Test Cases:

A   => 1
B   => 2
Z   => 26
AA  => 27
AC  => 29
AZ  => 52
BA  => 53
FC  => 159
ID  => 238
AAA => 703

Standard loopholes are forbidden.

Sandbox:

1. Are my test cases correct? They were done of the top of my head, so they may not be accurate.
2. Is this a duplicate? My searching suggests otherwise, but it may not be comprehensive.
3. Are there any other tags I could add?

Answer 25

DayByte Savings

Input: Any positive integer 1..n; or a year in the future (e.g. 2025)

Output: The date-times (UTC) that Britain will change to/from daylight savings times (i.e. 1am on the last Sunday in March and 2am on the last Sunday in October) between now (according to the machine running the code) and the current date in the year specified in the input. We can assume this rule won't change in the future.

Any valid list of date-time formats is fine for the output (e.g. "28th October 2018 2am" or "28-OCT-18T02:00:00" or "1540692000" [epoch time])

inspired by https://stackoverflow.com/questions/50839863/future-list-of-daylight-savings-changeover-date-times-uk

You could store all the data in your program (it counts towards your byte count), or just call a builtin that calculates it - your choice.

You can assume that 2099 (however far ahead that is) is the largest input.

code-golf, usual rules and exclusions apply. You won't have to deal with invalid inputs.

Example (assuming today is 23rd September 2019):

2020 or 1 -> 27th Oct 2019 2am; 29th Mar 2020 1am

2099 or 80 -> 27 October 2019 02:00:00
      29 March 2020 01:00:00
      25 October 2020 02:00:00
      28 March 2021 01:00:00
      31 October 2021 02:00:00
      27 March 2022 01:00:00
      30 October 2022 02:00:00
      26 March 2023 01:00:00
      29 October 2023 02:00:00
      31 March 2024 01:00:00
      27 October 2024 02:00:00
      30 March 2025 01:00:00
      26 October 2025 02:00:00
      29 March 2026 01:00:00
      25 October 2026 02:00:00
      28 March 2027 01:00:00
      31 October 2027 02:00:00
      26 March 2028 01:00:00
      29 October 2028 02:00:00
      25 March 2029 01:00:00
      28 October 2029 02:00:00
      31 March 2030 01:00:00
      27 October 2030 02:00:00
      30 March 2031 01:00:00
      26 October 2031 02:00:00
      28 March 2032 01:00:00
      31 October 2032 02:00:00
      27 March 2033 01:00:00
      30 October 2033 02:00:00
      26 March 2034 01:00:00
      29 October 2034 02:00:00
      25 March 2035 01:00:00
      28 October 2035 02:00:00
      30 March 2036 01:00:00
      26 October 2036 02:00:00
      29 March 2037 01:00:00
      25 October 2037 02:00:00
      28 March 2038 01:00:00
      31 October 2038 02:00:00
      27 March 2039 01:00:00
      30 October 2039 02:00:00
      25 March 2040 01:00:00
      28 October 2040 02:00:00
      31 March 2041 01:00:00
      27 October 2041 02:00:00
      30 March 2042 01:00:00
      26 October 2042 02:00:00
      29 March 2043 01:00:00
      25 October 2043 02:00:00
      27 March 2044 01:00:00
      30 October 2044 02:00:00
      26 March 2045 01:00:00
      29 October 2045 02:00:00
      25 March 2046 01:00:00
      28 October 2046 02:00:00
      31 March 2047 01:00:00
      27 October 2047 02:00:00
      29 March 2048 01:00:00
      25 October 2048 02:00:00
      28 March 2049 01:00:00
      31 October 2049 02:00:00
      27 March 2050 01:00:00
      30 October 2050 02:00:00
      26 March 2051 01:00:00
      29 October 2051 02:00:00
      31 March 2052 01:00:00
      27 October 2052 02:00:00
      30 March 2053 01:00:00
      26 October 2053 02:00:00
      29 March 2054 01:00:00
      25 October 2054 02:00:00
      28 March 2055 01:00:00
      31 October 2055 02:00:00
      26 March 2056 01:00:00
      29 October 2056 02:00:00
      25 March 2057 01:00:00
      28 October 2057 02:00:00
      31 March 2058 01:00:00
      27 October 2058 02:00:00
      30 March 2059 01:00:00
      26 October 2059 02:00:00
      28 March 2060 01:00:00
      31 October 2060 02:00:00
      27 March 2061 01:00:00
      30 October 2061 02:00:00
      26 March 2062 01:00:00
      29 October 2062 02:00:00
      25 March 2063 01:00:00
      28 October 2063 02:00:00
      30 March 2064 01:00:00
      26 October 2064 02:00:00
      29 March 2065 01:00:00
      25 October 2065 02:00:00
      28 March 2066 01:00:00
      31 October 2066 02:00:00
      27 March 2067 01:00:00
      30 October 2067 02:00:00
      25 March 2068 01:00:00
      28 October 2068 02:00:00
      31 March 2069 01:00:00
      27 October 2069 02:00:00
      30 March 2070 01:00:00
      26 October 2070 02:00:00
      29 March 2071 01:00:00
      25 October 2071 02:00:00
      27 March 2072 01:00:00
      30 October 2072 02:00:00
      26 March 2073 01:00:00
      29 October 2073 02:00:00
      25 March 2074 01:00:00
      28 October 2074 02:00:00
      31 March 2075 01:00:00
      27 October 2075 02:00:00
      29 March 2076 01:00:00
      25 October 2076 02:00:00
      28 March 2077 01:00:00
      31 October 2077 02:00:00
      27 March 2078 01:00:00
      30 October 2078 02:00:00
      26 March 2079 01:00:00
      29 October 2079 02:00:00
      31 March 2080 01:00:00
      27 October 2080 02:00:00
      30 March 2081 01:00:00
      26 October 2081 02:00:00
      29 March 2082 01:00:00
      25 October 2082 02:00:00
      28 March 2083 01:00:00
      31 October 2083 02:00:00
      26 March 2084 01:00:00
      29 October 2084 02:00:00
      25 March 2085 01:00:00
      28 October 2085 02:00:00
      31 March 2086 01:00:00
      27 October 2086 02:00:00
      30 March 2087 01:00:00
      26 October 2087 02:00:00
      28 March 2088 01:00:00
      31 October 2088 02:00:00
      27 March 2089 01:00:00
      30 October 2089 02:00:00
      26 March 2090 01:00:00
      29 October 2090 02:00:00
      25 March 2091 01:00:00
      28 October 2091 02:00:00
      30 March 2092 01:00:00
      26 October 2092 02:00:00
      29 March 2093 01:00:00
      25 October 2093 02:00:00
      28 March 2094 01:00:00
      31 October 2094 02:00:00
      27 March 2095 01:00:00
      30 October 2095 02:00:00
      25 March 2096 01:00:00
      28 October 2096 02:00:00
      31 March 2097 01:00:00
      27 October 2097 02:00:00
      30 March 2098 01:00:00
      26 October 2098 02:00:00
      29 March 2099 01:00:00

Answer 26

Golf a new OEIS sequence.

This is a code-golf challenge. The goal of this challenge is to create an integer sequence that is not in the OEIS using the fewest possible number of bytes.

Your program can either output an infinite list, or it can be a function from the natural numbers to the integers, which when evaluated on 1, 2, 3, 4,... gives a sequence that is not in the OEIS.

Restrictions

Without any restrictions, this is a very easy challenge, we can simply write a program that prints out the constant sequence consisting of 33, for example.

In order to avoid accepting "easy" sequences like this, your proposed sequence cannot be a finite linear combination or entrywise product of existing sequences or any rows or columns of existing tables in the OEIS.¹

Also, I want to avoid submissions that take an otherwise disallowed sequence and prepend some list (e.g. 3,1,1,1,1,1,1,1,1,1,1). Thus the above rule must stand even after ignoring the first N terms of the sequence.²

Challenge

Post your source code, the first few terms of the sequence, and an explanation of what your source code is doing.

It's okay if your submission is not very mathematically interesting, but I'm hoping that one or two will be.

(Lastly, if your sequence is disqualified by someone writing is as linear combinations of existing sequences, feel free to modify/fix it, but please don't delete it.)

---

¹ This rule disallows all polynomials in n, for example, since these can be written as finite linear combinations of columns in A009999 read as a square array.

² This rule also disallows all finite-length sequences.

Meta

Note: I don't know if this challenge is totally silly, or if it has obvious loopholes, or if closing loopholes results in a challenge that is too difficult or arbitrary.

• Tags: code-golf, sequence
• Is this a duplicate?
• Any other restrictions? Any loosening of current restrictions?

Answer 27

Draw a CE mark graphical-output

Your input is the scaling factor n. You must output an image of width 82n and height 48n (if you are generating a vector image, it should have that as its default size). The image will be either transparent or white, with the following regions in black:

• The segment of a ring centred at 24n,24n of outer radius 20n and inner radius 14n that is left of the vertical line at 26n.
• A copy of that segment displaced 34n to the right. The original rings would therefore exactly overlap if they were not segments.
• A rectangle with upper left corner at 44n,21n and lower right corner at 56n,27n.

This is code-golf, so the shortest program or function that breaks no standard loopholes wins!

Answer 28

moved

Answer 29

Typhoon: Where am I from? code-golfstringclassification

Introduction

A typhoon is basically a hurricane in the northwestern Pacific region. Unlike hurricanes, typhoons are named by 14 regions, each providing 10 names, adding up to 140 names. The 140 names are used in a cyclic pattern; after the last name is used, the first one will be used again. The names may sometimes be retired, mainly because of the devastation the typhoon with those names have made.

Here are the 140 names.

[Text-only]

Region             Column 1   Column 2   Column 3   Column 4   Column 5   Column 6   Column 7   Column 8   Column 9   Column 10
-------------------------------------------------------------------------------------------------------------------------------
Cambodia           Damrey     Ampil      Kong-rey   Krosa      Nakri      Maysak     Krovanh    Chanthu    Trases     Nesat
China              Haikui     Wukong     Yutu       Bailu      Fengshen   Haishen    Dujuan     Dianmu     Mulan      Haitang
DPR Korea          Kirogi     Jongdari   Toraji     Podul      Kalmaegi   Noul       Surigae    Mindulle   Meari      Nalgae
Hong Kong, China   Yun-yeung  Shanshan   Man-yi     Lingling   Fung-wong  Dolphin    Choi-wan   Lionrock   Ma-on      Banyan
Japan              Koinu      Yagi       Usagi      Kajiki     Kammuri    Kujira     Koguma     Kompasu    Tokage     Yamaneko
Lao PDR            Bolaven    Leepi      Pabuk      Faxai      Phanfone   Chan-hom   Champi     Namtheun   Hinnamnor  Pakhar
Macao, China       Sanba      Bebinca    Wutip      Peipah     Vongfong   Linfa      In-fa      Malou      Muifa      Sanvu
Malaysia           Jelawat    Rumbia     Sepat      Tapah      Nuri       Nangka     Cempaka    Nyatoh     Merbok     Mawar
Micronesia         Ewiniar    Soulik     Mun        Mitag      Sinlaku    Saudel     Nepartak   Rai        Nanmadol   Guchol
Philippines        Maliksi    Cimaron    Danas      Hagibis    Hagupit    Molave     Lupit      Malakas    Talas      Talim
RO Korea           Gaemi      Jebi       Nari       Neoguri    Jangmi     Goni       Mirinae    Megi       Noru       Doksuri
Thailand           Prapiroon  Mangkhut   Wipha      Bualoi     Mekkhala   Atsani     Nida       Chaba      Kulap      Khanun
U.S.A.             Maria      Barijat    Francisco  Matmo      Higos      Etau       Omais      Aere       Roke       Lan
Viet Nam           Son-Tinh   Trami      Lekima     Halong     Bavi       Vamco      Conson     Songda     Sonca      Saola

[JSON]

{"Cambodia":["Damrey","Ampil","Kong-rey","Krosa","Nakri","Maysak","Krovanh","Chanthu","Trases","Nesat"],"China":["Haikui","Wukong","Yutu","Bailu","Fengshen","Haishen","Dujuan","Dianmu","Mulan","Haitang"],"DPR Korea":["Kirogi","Jongdari","Toraji","Podul","Kalmaegi","Noul","Surigae","Mindulle","Meari","Nalgae"],"Hong Kong, China":["Yun-yeung","Shanshan","Man-yi","Lingling","Fung-wong","Dolphin","Choi-wan","Lionrock","Ma-on","Banyan"],"Japan":["Koinu","Yagi","Usagi","Kajiki","Kammuri","Kujira","Koguma","Kompasu","Tokage","Yamaneko"],"Lao PDR":["Bolaven","Leepi","Pabuk","Faxai","Phanfone","Chan-hom","Champi","Namtheun","Hinnamnor","Pakhar"],"Macao, China":["Sanba","Bebinca","Wutip","Peipah","Vongfong","Linfa","In-fa","Malou","Muifa","Sanvu"],"Malaysia":["Jelawat","Rumbia","Sepat","Tapah","Nuri","Nangka","Cempaka","Nyatoh","Merbok","Mawar"],"Micronesia":["Ewiniar","Soulik","Mun","Mitag","Sinlaku","Saudel","Nepartak","Rai","Nanmadol","Guchol"],"Philippines":["Maliksi","Cimaron","Danas","Hagibis","Hagupit","Molave","Lupit","Malakas","Talas","Talim"],"RO Korea":["Gaemi","Jebi","Nari","Neoguri","Jangmi","Goni","Mirinae","Megi","Noru","Doksuri"],"Thailand":["Prapiroon","Mangkhut","Wipha","Bualoi","Mekkhala","Atsani","Nida","Chaba","Kulap","Khanun"],"U.S.A.":["Maria","Barijat","Francisco","Matmo","Higos","Etau","Omais","Aere","Roke","Lan"],"Viet Nam":["Son-Tinh","Trami","Lekima","Halong","Bavi","Vamco","Conson","Songda","Sonca","Saola"]}

This chart is based from that on the Japan Meteorological Agency website, retrieved on 10 October 2019. Conventionally the list is divided into 5 columns, but in order to list all the names by region, I have organized them into 10 columns, so that each row fits all names from the same region. Moreover, two of the names, Mangkhut and Rumbia are retired and are still pending for replacement. Here I will keep these 2 names for integrity.

Challenge

Write a program or function, that receives a name in the list above as input, and returns or outputs which region it is named after.

The input and output formats are flexible. For input, you may omit the hyphens and/or receive all uppercase or lowercase input. For output, you may also instead return an element from a set of 14 distinct values of your choice, each representing a region.

Your program does not need to deal with invalid inputs.

Sample I/O

Input: Chan-hom (exact wording)
Output: Lao PDR (exact wording)

Input: Kongrey (Kon-grey; without hyphen)
Output: KH (Cambodia; ISO 3166 code, uppercase)

Input: atsani (Atsani; all lowercase)
Output: th (Thailand; ISO 3166 code, lowercase)

Input: LAN (Lan; all uppercase)
Output: 12 (U.S.A; 0-indexed)

Input: choiwan (Choi-wan; without hyphen & all lowercase)
Output: 4 (Hong Kong, China; 1-indexed)

Input: INFA (In-fa; without hyphen & all uppercase)
Output: Macau (Macao, China; common name) 

Again, you may have different output formats, but the input and output formats you use must be stated.

Winning Criteria

The shortest submission in each language wins. No loophole is allowed.

Answer 30

How often does the word sixty-eight (68) appear in numbers from 1 to N. The upper limit for N to which the program needs to be able to perform is 100 000 000.

The program will take N as input and return every number in which the word sixty-eight appears from 1 to N, and a sum of all appearances of sixty-eight at the end.

I'm looking for the spoken form, so the word sixty-eight appears in

68 000 000 - sixty-eight million - once

68 680 000 - sixty-eight million six-hundred thousand - once

68 068 068 - sixty-eight million sixty-eight thousand and sixty-eight - three times

and so on. The shortest implementation that gives a correct result wins.