API Response (JSON)
{
"problem": {
"name": "Non-coprime DAG",
"description": {
"content": "We have a directed graph $G$ with $N$ vertices numbered $1$ to $N$. Between two vertices $i,j$ ($1 \\leq i,j \\leq N$, $i \\neq j$), there is an edge $i \\to j$ if and only if both of the following condit",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "arc136_e"
},
"statements": [
{
"statement_type": "Markdown",
"content": "We have a directed graph $G$ with $N$ vertices numbered $1$ to $N$.\nBetween two vertices $i,j$ ($1 \\leq i,j \\leq N$, $i \\neq j$), there is an edge $i \\to j$ if and only if both of the following condit...",
"is_translate": false,
"language": "English"
}
]
}