Submission #36231285

---

Source Code Expand

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const int maxn = 1005;
int n, a[maxn], b[maxn], c[maxn];

int main() {
#ifdef DEBUG
	freopen("1.in", "r", stdin);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		while(a[i] % 2 == 0) {
			a[i] /= 2;
			b[i]++;
		}
		while(a[i] % 3 == 0) {
			a[i] /= 3;
			c[i]++;
		}
	}
	for(int i = 2; i <= n; i++) {
		if(a[i] != a[i - 1]) {
			cout << "-1\n";
			return 0;
		}
	}
	int m1 = *min_element(b + 1, b + 1 + n);
	int m2 = *min_element(c + 1, c + 1 + n);
	int ans = 0;
	for(int i = 1; i <= n; i++) {
		ans += b[i] - m1 + c[i] - m2;
	}
	cout << ans << '\n';
	return 0;
}

Submission Info

Judge Result