P10400 "STA - R5" The Disappearing Computer.

**This is an output-only problem.** The judge has a positive integer $n$ (you do not know the exact value of $n$). You have $10^3$ variables $p_1,p_2,\cdots,p_{10^3}$. Initially, $p_1=n$, and $p_2=p_3=\cdots=p_{10^3}=0$. You need to write a program to complete some tasks. Your program may use the following statements: - `new x`: set $n\gets n+1$, and $p_x\gets n$. - `dec x`: set $p_x\gets p_x-1$. - `assign x y`: set $p_x\gets p_y$. - `iftry x goto l`: if $p_x \ge 0$, jump to statement $l$. - `ifeq x y goto l`: if $p_x = p_y$, jump to statement $l$. - `ifneq x y goto l`: if $p_x\neq p_y$, jump to statement $l$. For the last three statements, **if the current statement is statement $\bm{l_0}$, then it is required that $\bm{l

This is an output-only problem. For each test point, the corresponding task can be found in the "Description".

For the given $10$ tasks, you need to submit your output files ``1.out`` to ``10.out`` separately. Each file should output several lines. The first line contains a non-negative integer $L$, representing the number of statements you use. The next $L$ lines each contain one statement.

**Scoring** For each test point, several groups of testdata will be evaluated. If your output has any of the following issues, then you will get $0$ points for that test point: - The output does not meet the requirement. - The actual number of executed statements is greater than $10^5$. - There are unrecognizable or invalid statements. - More than $1000$ statements are used, or variables with indices greater than $1000$ are used. Otherwise, let the scoring baseline for the corresponding subtask be $L_0$. Then your score is: $$\mathrm{score}=\begin{cases}11&L_0>L\\\Big\lfloor\frac{10}{\exp\left(1-\frac {L_0}L\right)}\Big\rfloor&\text{otherwise.}\end{cases}$$ The scoring baselines $L_0$ for each task are given below: | ID | $1$ | $2$ | $3$ | $4$ | $5$| $6$ | $7$ | $8$ | $9$ | $10$ | | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | :-: | | $L_0$ | $3$ | $9$ | $233$ | $1$ | $10$| $29$ | $14$ | $7$ | $18$ | $14$ | **Constraints** It is guaranteed that $5 \le n \le 100$. Translated by ChatGPT 5