{"problem":{"name":"[信息与未来 2018] 最大公约数","description":{"content":"输入三个正整数 $x,y,z$，求它们的最大公约数（Greatest Common Divisor）$g$：最大的正整数 $g ≥1$，满足 $x,y,z$ 都是 $g$ 的倍数，即 $(x \\bmod g) = (y \\bmod g) = (z \\bmod g) = 0$。","description_type":"Markdown"},"platform":"Luogu","limit":{"time_limit":1000,"memory_limit":131072},"difficulty":{"LuoguStyle":"P1"},"is_remote":true,"is_sync":true,"sync_url":null,"sign":"LGB3736"},"statements":[{"statement_type":"Markdown","content":"输入三个正整数 $x,y,z$，求它们的最大公约数（Greatest Common Divisor）$g$：最大的正整数 $g ≥1$，满足 $x,y,z$ 都是 $g$ 的倍数，即 $(x \\bmod g) = (y \\bmod g) = (z \\bmod g) = 0$。\n\n## Input\n\n输入一行三个正整数 $x,y,z$。\n\n## Output\n\n输出一行一个整数 $g$，表示 $x,y,z$ 的最大公约数。\n\n[samples]\n\n## Note\n\n### 样例解释\n#### 样例 $1$\n$12 = 2 × 6, 34 = 2 × 17, 56 = 2 × 28, g = 2$。\n#### 样例 $2$\n$28 = 14 × 2, 70 = 14 × 5, 28 = 14 × 2,g = 14$。\n### 数据规模\n所有数据满足 $1 ≤ x,y,z ≤ 10^6$。\n> 本题原始满分为 $15\\text{pts}$。","is_translate":false,"language":"English"}],"meta":{"iden":"LGB3736","tags":["数学","2018","江苏","最大公约数 gcd","循环结构","信息与未来"],"sample_group":[["12 34 56","2"],["28 70 28","14"]],"created_at":"2026-03-03 11:09:25"}}