摘要:
链接:Codeforces Round #789 (Div. 2) A. Tokitsukaze and All Zero Sequence 题目大意: 给定长度为$n$的数组,可以进行两种操作:1、如果$a_i = a_j$,则使其中一个等于$0$;2、使$a_i=a_j=min(a_i,a_j) 阅读全文
摘要:
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 阅读全文
摘要:
定理一 \(a\ mod\ b = a - b * \lfloor \frac {a}{b} \rfloor\) 证明: \[ \because a = k * b + r \\\therefore \lfloor \frac{a}{b} \rfloor = k \\即 a \ mod \ b = 阅读全文