P8741 [Lanqiao Cup 2021 NOI Qualifier B] Fill-in-the-Blank Problems

This problem set contains multiple fill-in-the-blank tasks. For each task, you only need to compute the result and submit it as required. ## Task A: Space ### Problem Description Xiao Lan plans to use $256 \mathrm{MB}$ of memory to create an array. Each element of the array is a $32$-bit binary integer. If we do not consider the space used by the program itself and the extra space needed for memory management, how many $32$-bit binary integers can be stored in $256 \mathrm{MB}$? ### Answer Submission This is a fill-in-the-blank question. You only need to compute the result and submit it. The result of this problem is an integer. When submitting, only fill in this integer. Any extra content will make you score $0$. ## Task B: Cards ### Problem Description Xiao Lan has many digit cards. Each card has a digit from $0$ to $9$. Xiao Lan wants to use these cards to form some numbers. He wants to start from $1$ and form positive integers. Each time he forms one number, he keeps it, and the cards used for that number cannot be used to form other numbers. Xiao Lan wants to know how far he can go starting from $1$. For example, when Xiao Lan has $30$ cards, with $3$ cards for each digit from $0$ to $9$, he can form numbers from $1$ to $10$. But when forming $11$, the digit card $1$ has only one card left, which is not enough to form $11$. Now Xiao Lan has $2021$ cards for each digit from $0$ to $9$, a total of $20210$ cards. How far can he form numbers starting from $1$? Hint: It is recommended to solve this problem using computer programming. ### Answer Submission This is a fill-in-the-blank question. You only need to compute the result and submit it. The result of this problem is an integer. When submitting, only fill in this integer. Any extra content will make you score $0$. ## Task C: Lines ### Problem Description In a Cartesian coordinate plane, two points determine a line. If multiple points lie on the same line, then the lines determined by any two of these points are the same. Given $2 \times 3$ integer lattice points on the plane: $\{(x,y) \mid 0 \leq x

Input one uppercase letter, indicating which task it is.

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

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