Question description​

There are $N$ classes in the ABC competitive programming school, and class number $i$ ($1 \leq i \leq N$) targets students with a rating of $A_i$.

Now, $Q$ students are about to join this school. The rating of student number $j$ ($1 \leq j \leq Q$) is $B_j$. Each student will be dissatisfied if they go to a class that does not match their level. The dissatisfaction for each student is defined as follows:

The absolute difference between the target rating $a$ and their own rating $b$, that is, $|a - b|$.

For $j = 1, 2, 3, \dots, Q$, find the minimum dissatisfaction that can be considered for student number $j$. It is allowed to have classes with no students or classes with multiple students.

Question description​

You are given a string $S$ of length $N$, consisting of only lowercase English letters.

Find the lexicographically smallest substring of $S$ with a length of $K$ and output it.

Note:
A substring of a string $T$ is a string obtained by removing 0 or more characters from $T$ and concatenating the remaining characters in their original order.

The definition of lexicographic order:
Let $X = x_1 x_2 \dots x_n$ and $Y = y_1 y_2 \dots y_m$ be two different strings. $X$ is said to be lexicographically smaller than $Y$ if and only if $X$ is a prefix of $Y$, or if $j$ is the smallest integer such that $x_j \neq y_j$, and $x_j < y_j$.

Question description​

You are given a set of digits: $c_1, c_2, \dots, c_K$. Find the number of positive integers with $N$ digits that can be created using only these digits and are divisible by $B$. Calculate the result modulo $10^9 + 7$.

Question description​

There is a grid with $H$ rows and $W$ columns. The cell at the $i$-th row from the top and $j$-th column from the left, denoted as $(i, j)$, contains the integer $A[i][j]$.

For all cells $(i, j)$ where $1 \leq i \leq H$ and $1 \leq j \leq W$, find the following value:

• The sum of integers written in the cells that are in the same row or the same column as cell $(i, j)$ (including the cell itself).

Question description​

There are $N$ cities, each numbered from $1, 2, 3, \dots, N$. There are also $N-1$ roads, with the $i$-th road connecting cities $A[i]$ and $B[i]$ bidirectionally. It is possible to travel between any two cities using some roads.

Now, you can freely choose integers $u, v$ ($1 \leq u < v \leq N$) and build a single new road that connects city $u$ and city $v$ bidirectionally. Then, the following value is considered as the score:

• The number of roads traveled in a route that returns to the same city without passing the same road twice (this value is uniquely determined).

Output the maximum possible score.

Question description​

Output all correct bracket sequences of length $N$ in lexicographic order.

A correct bracket sequence is defined as follows:

• () is a correct bracket sequence.
• When $S$ is a correct bracket sequence, the string ( + $S$ + ) is a correct bracket sequence.
• When $S$ and $T$ are correct bracket sequences, the string $S$ + $T$ is a correct bracket sequence.
• All other strings are not correct bracket sequences.

Problem description​

There is a Yokan of length $L$ [cm]. There are $N$ cutting points, and the $i$-th cutting point from the left is at position $A_i$ [cm] from the left.

You want to choose $K$ of the $N$ cutting points and divide the Yokan into $K+1$ pieces. Then, the following value is used as the score:

• The length of the shortest piece among the $K+1$ pieces

Find the score that can be obtained when dividing the Yokan to maximize the score.

Problem description:​

• Input : A string s
• Output: Return the longest palindromic substring in s