摘要: https://www.luogu.com.cn/training/168096 CF1359E Lemma: \(\forall x\in \mathbb{N},\ x \bmod a \bmod b=x \bmod b \bmod a \iff a\mid b\ (a<b)\) Proof: 因 阅读全文
posted @ 2024-07-09 11:51 studentDL 阅读(27) 评论(0) 推荐(0)