API Response (JSON)
{
"problem": {
"name": "Colorful Star",
"description": {
"content": "There is a tree with $NM+1$ vertices numbered $0$ to $NM$. The $i$\\-th edge ($1 \\le i \\le NM$) connects vertices $i$ and $\\max(i-N,0)$. Initially, vertex $i$ is colored with color $i \\bmod N$. You can",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "arc176_f"
},
"statements": [
{
"statement_type": "Markdown",
"content": "There is a tree with $NM+1$ vertices numbered $0$ to $NM$. The $i$\\-th edge ($1 \\le i \\le NM$) connects vertices $i$ and $\\max(i-N,0)$.\nInitially, vertex $i$ is colored with color $i \\bmod N$. You can...",
"is_translate": false,
"language": "English"
}
]
}