Hello guys. in codeforces round 665 problem C , it was written that: {In one operation, you can choose two different indices i and j (1≤i,j≤n). If gcd(ai,aj) is equal to the minimum element of the whole array a, you can swap ai and aj. gcd(x,y) denotes the greatest common divisor (GCD) of integers x and y.} so , from this i understood that the gcd should equal to the mn right? so i wrote this program: 90592067 but it got me WA. then i changed it to if gcd % mn == 0 in here 90635208 and it got me accepted. did i misunderstand the problem or it was written wrong? and thx.