
Codeforces
文章平均质量分 83
Hundreds_N
这个作者很懒,什么都没留下…
展开
-
B. Nastia and a Good Array
Nastia has received an array of n positive integers as a gift.She calls such an array a good that for all i (2≤i≤n) takes place gcd(ai−1,ai)=1, where gcd(u,v) denotes the greatest common divisor (GCD) of integers u and v.You can perform the operation: se原创 2021-05-08 12:46:12 · 299 阅读 · 0 评论 -
A. Nastia and Nearly Good Numbers
Nastia has 2 positive integers A and B. She defines that:The integer is good if it is divisible by A⋅B;Otherwise, the integer is nearly good, if it is divisible by A.For example, if A=6 and B=4, the integers 24 and 72 are good, the integers 6, 660 and 1原创 2021-05-08 07:44:59 · 272 阅读 · 0 评论