{"problem":{"name":"168. Pascal's Triangle","description":{"content":"First envisioned by the French mathematician, Blaise Pascal, Pascal's Triangle is a formation of numerals that are arranged in such a way that a number composing a part of the triangle is the summatio","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269168"},"statements":[{"statement_type":"Markdown","content":"First envisioned by the French mathematician, Blaise Pascal, Pascal's Triangle is a formation of numerals that are arranged in such a way that a number composing a part of the triangle is the summation of the adjacent binomial pair of the previous row in the triangle.\n\nThe only line of input contains a single positive integer $n$.\n\nOutput $n$ lines. The $i$th line should contain $i$ space-separated integers, consisting of the $i$th row of Pascal's Triangle.\n\n## Input\n\nThe only line of input contains a single positive integer $n$.\n\n## Output\n\nOutput $n$ lines. The $i$th line should contain $i$ space-separated integers, consisting of the $i$th row of Pascal's Triangle.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of rows to generate.  \nFor $ i \\in \\{1, \\dots, n\\} $, let $ R_i = ( \\binom{i-1}{0}, \\binom{i-1}{1}, \\dots, \\binom{i-1}{i-1} ) $ denote the $ i $-th row of Pascal’s Triangle.\n\n**Constraints**  \n$ n \\geq 1 $\n\n**Objective**  \nFor each $ i \\in \\{1, \\dots, n\\} $, output the row $ R_i $ as $ i $ space-separated integers:  \n$$\n\\binom{i-1}{0}, \\binom{i-1}{1}, \\dots, \\binom{i-1}{i-1}\n$$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269168","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}