API Response (JSON)
{
"problem": {
"name": "A. Arpa and a research in Mexican wave",
"description": {
"content": "Arpa is researching the Mexican wave. There are _n_ spectators in the stadium, labeled from 1 to _n_. They start the Mexican wave at time 0. * At time 1, the first spectator stands. * At time 2,",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF851A"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Arpa is researching the Mexican wave.\n\nThere are _n_ spectators in the stadium, labeled from 1 to _n_. They start the Mexican wave at time 0.\n\n* At time 1, the first spectator stands.\n* At time 2,...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "Arpa 正在研究墨西哥波浪。\n\n体育场中有 #cf_span[n] 名观众,编号从 #cf_span[1] 到 #cf_span[n]。他们在时间 #cf_span[0] 开始表演墨西哥波浪。\n\nArpa 想知道在时间 #cf_span[t] 时有多少名观众是站立的。\n\n第一行包含三个整数 #cf_span[n], #cf_span[k], #cf_span[t](#cf_span[1 ≤ n ...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ n, k, t \\in \\mathbb{Z}^+ $ with $ 1 \\leq n \\leq 10^9 $, $ 1 \\leq k \\leq n $, and $ 1 \\leq t < n + k $. \n\nThe Mexican wave proceeds as follows: \n- At time $ 0 $, all spectator...",
"is_translate": false,
"language": "Formal"
}
]
}