题解 | 小红的k次方

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define endl '\n'
using vi=vector<int>;
using vll=vector<ll>;
using pqi=priority_queue<int>;
using pqll=priority_queue<ll>;
using qi=queue<int>;
typedef pair<int,int> pii;
using vpii=vector<pii>;
const int MOD=998244353;

int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n;cin>>n;
    int cnt2=0,cnt3=0,cnt5=0;
    for(int i=0;i<n;i++){
        int x;cin>>x;
        while (x%2==0) {
            cnt2++;
            x/=2;
        }
        while (x%3==0) {
            cnt3++;
            x/=3;
        }
        while (x%5==0) {
            cnt5++;
            x/=5;
        }
    }
    cout<<min({cnt2,cnt3,cnt5})<<endl;
    return 0;
}