P7024 [NWRRC 2017] Fygon 2.0

The new version of beloved programming language Fygon has been released! The brand new Fygon $2$ . $0$ still has only two statements. The first statement is lag. It substitutes almost any other statement. Second statement is a for loop: ``` for in range(, ): ``` The for loop makes iterate from to , both inclusive. If is greater than , is not executed at all. is a lowercase letter from a to $z$ , except for $n$ , which is a variable that is defined prior to the given code snippet. and can be equal to any variable defined in outer loop. In addition to that, can be $1$ and can be $n$ . The of the loop is indented by four spaces and contains at least one statement. If you are familiar with Fygon $1$ . $0$ , you can notice that, in the spirit of the best programming practices, Fygon $2$ . $0$ is not backwards compatible, since the range function now requires two parameters. The performance of the new version is significantly improved, so you can write more nested for loops. That is why we are no longer interested in the exact number of operations, but in the asymptotic complexity of the program instead. For simplicity, all for loops are nested in a single chain and there is exactly one lag statement that is inside all for loops. All loop variables are different and are not equal to $n$ . Let's define $f(n)$ as the number of lag operations exectuted by a given Fygon program as the function of $n$ . For non-negative integer $k$ and positive rational number $C$ we say that $C · n^{k}$ is the asymptotic complexity of the program if $$\lim_{n \to \infty}{\frac{f(n)}{C \cdot n^k}} = 1$$ Given a Fygon $2$ . $0$ program, find its asymptotic complexity.

无

无

Time limit: 3 s, Memory limit: 512 MB.