API Response (JSON)
{
"problem": {
"name": "Longest Path",
"description": {
"content": "There is a directed graph $G$ with $N$ vertices and $M$ edges. The vertices are numbered $1, 2, \\ldots, N$, and for each $i$ ($1 \\leq i \\leq M$), the $i$\\-th directed edge goes from Vertex $x_i$ to $y",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "dp_g"
},
"statements": [
{
"statement_type": "Markdown",
"content": "There is a directed graph $G$ with $N$ vertices and $M$ edges. The vertices are numbered $1, 2, \\ldots, N$, and for each $i$ ($1 \\leq i \\leq M$), the $i$\\-th directed edge goes from Vertex $x_i$ to $y...",
"is_translate": false,
"language": "English"
}
]
}