80pts猎奇代码，求条

#include <bits/stdc++.h>
using namespace std;
int t, n, m, a[10010];
int main () {
    cin >> t;
    while (t --) {
        cin >> n >> m;
        map <int, int> mp;
        for (int i = 1; i <= n; i ++) 
            cin >> a[i], mp[a[i]] ++;
        bool f = 1;               
        for (int i = 1; i < n; i ++) 
            if (a[i] != a[i + 1]) {
                f = 0;
                break;
            }
        int gcd = mp[a[1]];
        map <int, bool> mpp;
        for (auto& [u, v] : mp) 
            gcd = __gcd (gcd, v), mpp[v] = 1;
        if (! f) {
            if (gcd > 1 || mp.size () == 1) cout << (long long) (m / (n / gcd)) << '\n';            
            else cout << 0 << '\n';
        } else 
            cout << m << '\n';
    }
}