API Response (JSON)
{
"problem": {
"name": "Counting of Trees",
"description": {
"content": "Given is an integer sequence $D_1,...,D_N$ of $N$ elements. Find the number, modulo $998244353$, of trees with $N$ vertices numbered $1$ to $N$ that satisfy the following condition: * For every int",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "nikkei2019_2_qual_b"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Given is an integer sequence $D_1,...,D_N$ of $N$ elements. Find the number, modulo $998244353$, of trees with $N$ vertices numbered $1$ to $N$ that satisfy the following condition:\n\n* For every int...",
"is_translate": false,
"language": "English"
}
]
}