Max GCD（暴力）

題目描述 We have a sequence of N integers: A1,A2,⋯,AN. You can perform the following operation between 0 and K times (inclusive): ·Choose two integers i and j such that i≠j, each between 1 and N (inclusiv

>>阅读原文<<