2017年5月3日
CodeForce-798C Mike and gcd problem（贪心）
摘要： Mike has a sequence A = [a1, a2, ..., an] of length n. He considers the sequence B = [b1, b2, ..., bn] beautiful if the gcd of all its elements is big 阅读全文
posted @ 2017-05-03 19:18 饼饼饼饼饼 阅读(440) 评论(0) 推荐(0) 编辑