API Response (JSON)
{
"problem": {
"name": "Growth Rate",
"description": {
"content": "Given is a positive integer $M$ and a sequence of $N$ integers: $A = (A_1,A_2,\\ldots,A_N)$. Find the number, modulo $998244353$, of sequences of $N+1$ integers, $X = (X_1,X_2, \\ldots, X_{N+1})$, satis",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 4000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "arc118_f"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Given is a positive integer $M$ and a sequence of $N$ integers: $A = (A_1,A_2,\\ldots,A_N)$. Find the number, modulo $998244353$, of sequences of $N+1$ integers, $X = (X_1,X_2, \\ldots, X_{N+1})$, satis...",
"is_translate": false,
"language": "English"
}
]
}