API Response (JSON)
{
"problem": {
"name": "Permutation",
"description": {
"content": "Let $N$ be a positive integer. You are given a string $s$ of length $N - 1$, consisting of `<` and `>`. Find the number of permutations $(p_1, p_2, \\ldots, p_N)$ of $(1, 2, \\ldots, N)$ that satisfy th",
"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_t"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Let $N$ be a positive integer. You are given a string $s$ of length $N - 1$, consisting of `<` and `>`.\nFind the number of permutations $(p_1, p_2, \\ldots, p_N)$ of $(1, 2, \\ldots, N)$ that satisfy th...",
"is_translate": false,
"language": "English"
}
]
}