A. Make a spiral

Xotira: 32 MB, Vaqt: 1000 ms

Your task, is to create a NxN spiral with a given \(size\).

8

1 1 1 1 1 1 1 1 
0 0 0 0 0 0 0 1 
1 1 1 1 1 1 0 1 
1 0 0 0 0 1 0 1 
1 0 1 0 0 1 0 1 
1 0 1 1 1 1 0 1 
1 0 0 0 0 0 0 1 
1 1 1 1 1 1 1 1

B. Breaking chocolate problem

Xotira: 32 MB, Vaqt: 1000 ms

Your task is to split the chocolate bar of given dimension \(n\) x \(m\) into small squares. Each square is of size 1x1 and unbreakable. Implement a function that will return minimum number of breaks needed.

For example if you are given a chocolate bar of size \(2\) x \(1\) you can split it to single squares in just one break, but for size \(3\) x \(1\) you must do two breaks.

If input data is invalid you should return 0 (as in no breaks are needed if we do not have any chocolate to split). Input will always be a non-negative integer.

5 5

24

C. Integer to Nested Structure

Xotira: 32 MB, Vaqt: 1000 ms

Your task is to split the chocolate bar of given dimension n x m into small squares. Each square is of size 1x1 and unbreakable. Implement a function that will return minimum number of breaks needed.

For example if you are given a chocolate bar of size 2 x 1 you can split it to single squares in just one break, but for size 3 x 1 you must do two breaks.

If input data is invalid you should return 0 (as in no breaks are needed if we do not have any chocolate to split). Input will always be a non-negative integer.

decode(5)

6

encode(10000)

179189987

D. Texas Hold'em Hands

Xotira: 32 MB, Vaqt: 1000 ms

Texas Hold'em is a Poker variant in which each player is given two "hole cards". Players then proceed to make a series of bets while five "community cards" are dealt. If there are more than one player remaining when the betting stops, a showdown takes place in which players reveal their cards. Each player makes the best poker hand possible using five of the seven available cards (community cards + the player's hole cards).

Possible hands are, in descending order of value:

1. Straight-flush (five consecutive ranks of the same suit). Higher rank is better.
2. Four-of-a-kind (four cards with the same rank). Tiebreaker is first the rank, then the rank of the remaining card.
3. Full house (three cards with the same rank, two with another). Tiebreaker is first the rank of the three cards, then rank of the pair.
4. Flush (five cards of the same suit). Higher ranks are better, compared from high to low rank.
5. Straight (five consecutive ranks). Higher rank is better.
6. Three-of-a-kind (three cards of the same rank). Tiebreaker is first the rank of the three cards, then the highest other rank, then the second highest other rank.
7. Two pair (two cards of the same rank, two cards of another rank). Tiebreaker is first the rank of the high pair, then the rank of the low pair and then the rank of the remaining card.
8. Pair (two cards of the same rank). Tiebreaker is first the rank of the two cards, then the three other ranks.
9. Nothing. Tiebreaker is the rank of the cards from high to low.

Given hole cards and community cards, complete the function hand to return the type of hand (as written above, you can ignore case) and a list of ranks in decreasing order of significance, to use for comparison against other hands of the same type, of the best possible hand.

hand(["A:♠", "A♦"], ["J♣", "5♥", "10♥", "2♥", "3♦"])
// ...should return {type: "pair", ranks: ["A", "J", "10", "5"]}
hand(["A♠", "K♦"], ["J♥", "5♥", "10♥", "Q♥", "3♥"])
// ...should return {type: "flush", ranks: ["Q", "J", "10", "5", "3"]}

EDIT: for Straights with an Ace, only the ace-high straight is accepted. An ace-low straight is invalid (ie. A,2,3,4,5 is invalid). This is consistent with the author's reference solution. ~docgunthrop

type:'nothing' ranks:['A','K','Q','J','9']

hand(['K♠','A♦'],['J♣','Q♥','9♥','2♥','3♦']