API Response (JSON)
{
"problem": {
"name": "B. Igor and his way to work",
"description": {
"content": "Woken up by the alarm clock Igor the financial analyst hurried up to the work. He ate his breakfast and sat in his car. Sadly, when he opened his GPS navigator, he found that some of the roads in Bank",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 3000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF793B"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Woken up by the alarm clock Igor the financial analyst hurried up to the work. He ate his breakfast and sat in his car. Sadly, when he opened his GPS navigator, he found that some of the roads in Bank...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "被闹钟吵醒后，金融分析师 Igor 急匆匆赶往工作地点。他吃完早餐，坐进车里。可惜的是，当他打开 GPS 导航时，发现他所居住的城市 Bankopolis 的一些道路因施工而封闭。此外，Igor 的方向盘有问题，因此他在前往银行的路上最多只能转弯两次。\n\nBankopolis 呈现为一个 #cf_span[n] 行 #cf_span[m] 列的网格。Igor 需要找到一条从家到银行的路径，该路径最...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ n, m \\in \\mathbb{Z}^+ $ denote the dimensions of the grid. \nLet $ G \\in \\{ \\text{'.', 'X', 'S', 'T'} \\}^{n \\times m} $ be the grid, where: \n- `'.'` denotes an open cell, \n- ...",
"is_translate": false,
"language": "Formal"
}
]
}