摘要: 目录 Description State Input Output Solution Code Description 有 \(n\) 个数,要求找到最小的 \(seed\), 使得 \(a[i]%seed\) 都不相同 State \(1<=n<=5*10^5\) \(0<=a[i]<=5*10^ 阅读全文
posted @ 2021-10-04 09:53 Bcoi 阅读(69) 评论(0) 推荐(0)