CodeForces - 803C Maximal GCD
Maximal GCDYou are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a1, a2, …, ak, that their sum is equal to n and greatest common divisor is
原创
2017-08-01 18:46:38 ·
556 阅读 ·
0 评论