Hundreds_N的博客

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

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