随笔分类 -  数学-GCD

CodeForces 803 C Maximal GCD（GCD+思维）
摘要：You are given positive integer number n. You should create such strictly increasingsequence of k positive numbers a1, a2, ..., ak, that their sum is e 阅读全文
posted @ 2018-09-08 21:52 真想不出名字了 阅读(251) 评论(0) 推荐(0)