2017年5月5日
CodeForces798cMike 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-05 20:50 诚信肥宅 阅读(332) 评论(0) 推荐(0)
CodeForces#411div2 D. Minimum number of steps
摘要： D. Minimum number of steps time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test input standard i 阅读全文
posted @ 2017-05-05 20:14 诚信肥宅 阅读(226) 评论(0) 推荐(0)