P8679 [Lanqiao Cup 2019 NOI Qualifier B] Fill-in-the-Blank Problems

## Task $\mathrm{A}$: Team Formation ### [Problem Description] As a basketball coach, you need to select one player for each position from position $1$ to position $5$ from the list below, forming the starting lineup. The scores of each player when playing positions $1$ to $5$ are shown in the table below. Please calculate the maximum possible sum of the scores for positions $1$ to $5$ in the starting lineup.  (A file team.txt is provided in the attachments, whose content is the same as the table above. Please note that the first column is the ID number.) ### [Answer Submission] This is a fill-in-the-blank (result-only) problem. You only need to compute the result and submit it. The result is an integer. When submitting, enter only this integer. Any extra content will result in no score. ## Task B: Year-Number String ### [Problem Description] Xiaoming maps the letter `A` to the number $1$, `B` to $2$, and so on, with `Z` mapped to $26$. For numbers greater than or equal to $27$, Xiaoming uses a string of length two or more to represent them. For example, `AA` corresponds to $27$, `AB` corresponds to $28$, `AZ` corresponds to $52$, and `LQ` corresponds to $329$. What string corresponds to $2019$? ### [Answer Submission] This is a fill-in-the-blank (result-only) problem. You only need to compute the result and submit it. The result is an uppercase English string. When submitting, enter only this string (all uppercase). Any extra content will result in no score. ## Task $\mathrm{C}$: Sequence Evaluation ### [Problem Description] Given the sequence $1,1,1,3,5,9,17,\cdots$, starting from the 4th term, each term is the sum of the previous 3 terms. Find the last 4 digits of the $20190324$-th term. ### [Answer Submission] This is a fill-in-the-blank (result-only) problem. You only need to compute the result and submit it. The result is a 4-digit integer (hint: the thousands digit is not $0$). When submitting, enter only this integer. Any extra content will result in no score. ## Task D: Decomposing a Number ### [Problem Description] Decompose $2019$ into the sum of $3$ distinct positive integers, and require that none of these integers contains the digits $2$ or $4$. How many different decompositions are there? Note that swapping the order of the $3$ integers is considered the same decomposition. For example, $1000+1001+18$ and $1001+1000+18$ are considered the same. ### [Answer Submission] This is a fill-in-the-blank (result-only) problem. You only need to compute the result and submit it. The result is an integer. When submitting, enter only this integer. Any extra content will result in no score. ## Task E: Maze ### [Problem Description] The following figure shows a planar map of a maze, where cells marked `1` are obstacles and cells marked `0` are passable. ``` 010000 000100 001001 110000 ``` The entrance of the maze is the top-left corner, and the exit is the bottom-right corner. In the maze, you can move from one position to one of its four directions: up, down, left, or right. For the maze above, starting from the entrance, you can pass through the maze following the sequence `DRRURRDDDR`, for a total of $10$ steps. Here $\mathrm{D}$, $\mathrm{U}$, $\mathrm{L}$, $\mathrm{R}$ mean moving down, up, left, and right, respectively. For the following more complex maze ($30$ rows and $50$ columns), please find a way to pass through the maze using the minimum number of steps. Among all solutions with the minimum number of steps, output the lexicographically smallest one. Note that in lexicographical order, $\mathrm{D}

Input one uppercase letter indicating which task it is.

According to the input task label, output the answer to the corresponding task.

Answer template for reference. ```cpp #include using namespace std; int main() { string ans [] = { "The answer of task A", // Replace inside the quotes with the answer for task A "The answer of task B", // Replace inside the quotes with the answer for task B "The answer of task C", // Replace inside the quotes with the answer for task C "The answer of task D", // Replace inside the quotes with the answer for task D "The answer of task E", // Replace inside the quotes with the answer for task E }; char T; cin >> T; cout