摘要: Codeforces Round #781 (Div. 2) A. GCD vs LCM 题目大意:给定$n$,要求输出$a$,\(b\),\(c\),\(d\),使其满足$a + b + c + d = d$,\(gcd(a, b) = lcm(c,d)\) 解题思路:\(\forall x (x 阅读全文
posted @ 2022-04-12 18:37 Muly 阅读(67) 评论(0) 推荐(0)