Mike and gcd problem Codeforces Round #410 (Div. 2)
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 wants to change his sequence in
原创
2017-05-04 10:39:32 ·
341 阅读 ·
0 评论