API Response (JSON)
{
"problem": {
"name": "Typical Permutation Descriptor",
"description": {
"content": "You are given a sequence of integers $(A_1,\\dots,A_N)$ of length $N$. This sequence satisfies $0\\le A_i < i$ for each $i=1,\\dots,N$. Find the number of permutations $(P_1,\\dots,P_N)$ of $(1,\\dots,N)$ ",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "arc186_b"
},
"statements": [
{
"statement_type": "Markdown",
"content": "You are given a sequence of integers $(A_1,\\dots,A_N)$ of length $N$. This sequence satisfies $0\\le A_i < i$ for each $i=1,\\dots,N$. Find the number of permutations $(P_1,\\dots,P_N)$ of $(1,\\dots,N)$ ...",
"is_translate": false,
"language": "English"
}
]
}