{"problem":{"name":"Practical Computing","description":{"content":"Find the $N$ integer sequences $A_0,\\ldots,A_{N-1}$ defined as follows. *   For each $i$ $(0\\leq i \\leq N-1)$, the length of $A_i$ is $i+1$. *   For each $i$ and $j$ $(0\\leq i \\leq N-1, 0 \\leq j \\leq","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc254_b"},"statements":[{"statement_type":"Markdown","content":"Find the $N$ integer sequences $A_0,\\ldots,A_{N-1}$ defined as follows.\n\n*   For each $i$ $(0\\leq i \\leq N-1)$, the length of $A_i$ is $i+1$.\n*   For each $i$ and $j$ $(0\\leq i \\leq N-1, 0 \\leq j \\leq i)$, the $(j+1)$\\-th term of $A_i$, denoted by $a_{i,j}$, is defined as follows.\n    *   $a_{i,j}=1$, if $j=0$ or $j=i$.\n    *   $a_{i,j} = a_{i-1,j-1} + a_{i-1,j}$, otherwise.\n\n## Constraints\n\n*   $1 \\leq N \\leq 30$\n*   $N$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc254_b","tags":[],"sample_group":[["3","1\n1 1\n1 2 1"],["10","1\n1 1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n1 5 10 10 5 1\n1 6 15 20 15 6 1\n1 7 21 35 35 21 7 1\n1 8 28 56 70 56 28 8 1\n1 9 36 84 126 126 84 36 9 1"]],"created_at":"2026-03-03 11:01:14"}}