API Response (JSON)
{
"problem": {
"name": "Sum of SCC",
"description": {
"content": "Consider a directed graph $G$ with $N$ vertices numbered $1$ to $N$ that satisfies all of the following conditions. * $G$ is a tournament. In other words, $G$ has no multi-edges or self-loops, and ",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "arc163_d"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Consider a directed graph $G$ with $N$ vertices numbered $1$ to $N$ that satisfies all of the following conditions.\n\n* $G$ is a tournament. In other words, $G$ has no multi-edges or self-loops, and ...",
"is_translate": false,
"language": "English"
}
]
}