Codeforces Round #708 (Div. 2) E2. Square-free division (hard version)
摘要：
E2. Square-free division (hard version) This is the hard version of the problem. The only difference is that in this version 0≤k≤20. There is an array 阅读全文
posted @ 2021-03-30 19:01 Aminers 阅读(98) 评论(0) 推荐(0) 编辑
