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 bigger than 1, i.e. .Mike has a sequence A = [a1, a2, …, an] of l
阅读背景：
C. Mike and gcd problem 数论 + 贪心
来源：互联网
分享到：
