API Response (JSON)
{
"problem": {
"name": "C. Vladik and fractions",
"description": {
"content": "Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer _n_ he can represent fraction as a sum of three distinct positive fractions in form . ",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF743C"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer _n_ he can represent fraction as a sum of three distinct positive fractions in form .\n...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "Vladik 和 Chloe 决定谁更擅长数学。Vladik 声称，对于任意正整数 $n$，他都能将分数 $\\frac{2}{n}$ 表示为三个互不相同的正分数之和，形式为 $\\frac{1}{x} + \\frac{1}{y} + \\frac{1}{z}$。\n\n请帮助 Vladik，即对于给定的 $n$，找出三个互不相同的正整数 $x$、$y$ 和 $z$，使得 $\\frac{1}{x} + \\f...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "Given: \n- Integer $ n $, where $ 1 \\leq n \\leq 10^4 $. \n\nFind: \n- Three distinct positive integers $ x, y, z $, each $ \\leq 10^9 $, such that \n $$\n \\frac{2}{n} = \\frac{1}{x} + \\frac{1}{y} + \\fra...",
"is_translate": false,
"language": "Formal"
}
]
}