API Response (JSON)
{
"problem": {
"name": "A. Arpa’s hard exam and Mehrdad’s naive cheat",
"description": {
"content": "_There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do._ Mehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, ",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF742A"
},
"statements": [
{
"statement_type": "Markdown",
"content": "_There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do._\n\nMehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, ...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "_存在一个名为 Arpa 土地的岛屿，那里住着一些美丽的女孩，也有丑陋的女孩。_\n\nMehrdad 想成为 Arpa 土地的部长。Arpa 准备了一场考试，考试只有一道题：给定 #cf_span[n]，请输出 #cf_span[1378n] 的最后一位数字。\n\nMehrdad 感到非常困惑，希望你帮助他。请帮帮他吧，尽管这只是一个简单的作弊方法。\n\n输入的唯一一行包含一个整数 #cf_span[n...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ n \\in \\mathbb{Z} $, $ 0 \\leq n \\leq 10^9 $. \n\n**Objective** \nCompute the last digit of $ 1378^n $, i.e., compute $ 1378^n \\mod 10 $....",
"is_translate": false,
"language": "Formal"
}
]
}