#C9919. Generate Catalan Numbers
Generate Catalan Numbers
Generate Catalan Numbers
Given a non-negative integer \(n\), generate the first \(n+1\) Catalan numbers. The Catalan numbers are a sequence of natural numbers with significant applications in combinatorial mathematics. They can be computed using the formula:
\[ C_n = \frac{(2n)!}{(n+1)!\,n!} \]
Each subsequent number in the sequence can be computed from the previous one using an iterative method. Your task is to compute and output the sequence.
inputFormat
The input is read from stdin and consists of a single integer (n) (where (0 \leq n \leq 10)). This integer represents that you need to generate the sequence from (C_0) up to (C_n).
outputFormat
Output the generated Catalan numbers separated by a single space to stdout on one line.## sample
0
1
</p>