2018年4月19日
CodeForces - 803C Maximal GCD 【构造】
摘要： You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a1, a2, ..., ak, that their sum is 阅读全文
posted @ 2018-04-19 18:20 euzmin 阅读(161) 评论(0) 推荐(0) 编辑