NOIP 2009 普及组 细胞分裂

#include <bits/stdc++.h>
using namespace std;

int n, m1, m2, s;
int b[100], p[100];		//b1^p1 * b2^p2 * b3^p3 ...

int main() {
	cin >> n >> m1 >> m2;
	
	int i = 2, cnt = 0, factors = 1;	//product of factors;
	while (m1 != 1) {
		if (m1 % i == 0) cnt ++, factors *= i;
		while (m1 % i == 0) {
			b[cnt] = i;
			p[cnt] += m2;
			m1 /= i;
		}
		i ++;
	}

	bool flag = false;
	int maxx, minn = 1e9;
	while (n --) {
		cin >> s;
		if (s % factors == 0) {
			flag = true;
			maxx = 0;
			for (int i = 1; i <= cnt; i ++) {
				int t = s, q = 0;		//s能被b[j]^q整除 
				while (t % b[i] == 0) {
					q ++;
					t /= b[i];
				}
				maxx = max(maxx, (int)ceil(p[i] * 1.0 / q));
			}
			minn = min(minn, maxx);
		}
	}
	
	if (flag) cout << minn;
	else cout << -1;

	return 0;
}