摘要: Codeforces Round 911 (Div. 2) D D. Small GCD 题意 定义\(f(a,b,c)\)为\(a,b,c\)中较小两个数的\(gcd\),给定数组\(a_{1...n}\),求 \[\begin{aligned} \sum\limits_{i=1}^{n}\sum 阅读全文
posted @ 2023-11-28 20:41 Ke_scholar 阅读(48) 评论(0) 推荐(0) 编辑