Codeforces Round 1028 (Div. 2) C. Gellyfish and Flaming Peony

Codeforces Round 1028 (Div. 2) C. Gellyfish and Flaming Peony

题目

Gellyfish hates math problems, but she has to finish her math homework:

Gellyfish is given an array of $n$ positive integers $a_1,a_2,\dots ,a_n$.

She needs to do the following two-step operation until all elements of $a$ are equal:

1. Select two indexes $i$, $j$ satisfying $1\le i,j\le n$ and $i\ne j$.
2. Replace $a_i$ with $\gcd (a_i,a_j)$.

Now, Gellyfish asks you for the minimum number of operations to achieve her goal.

It can be proven that Gellyfish can always achieve her goal.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1\le t\le 5000$). The description of the test cases follows.

The first line of each test case contains a single integer $n$ ($1\le n\le 5000$) — the length of the array.

The second line of each test case contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 5000$) — the elements of the array.

It is guaranteed that the sum of $n$ over all test cases does not exceed $5000$.

Output

For each test case, output a single integer — the minimum number of operations to achieve her goal.

题目解析及思路

题目要求不断执行操作，使数组所有元素相等，输出最少的操作数

操作：选择两个下标i,j，将a[i]替换为gcd(a[i],a[j])

样例输入

3
12 20 30

样例输出

4

代码

/*
不难想到，最终相同的数一定是所有元素的gcd，因此先求出这个最终数，如果他本身就存在，那么其他所有数变到最终数只需要一次操作，如果不存在，再考虑将某个元素变成这个最终数的最少次数
*/
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;void solve(){int n;cin>>n;vector<int> a(n);//哈希表记录次数map<int,int> mp;int g = 0;for(int &i:a){cin>>i;mp[i] ++;g = gcd(g,i);}//如果g本身存在，输出所有不为g的数的数量if(mp[g]){cout<<n-mp[g]<<endl;return;}int N = 5001;//暴力枚举所有可能数(因为只有5000就暴力了，如果更多要用dp)vector<int> op(N,1e9);for(int x:a){//x存在，操作数为0op[x] = 0;//枚举所有可能数与x求gcdfor(int i=1;i<N;i++){int gg = gcd(i,x);op[gg] = min(op[gg],op[i] + 1);}}cout<<op[g] + n-1<<endl;
}
signed main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int t;cin>>t;while(t--){solve();}
}

(0);
cout.tie(0);

int t;
cin>>t;
while(t--){solve();
}

}