Codeforces Div3 #565 A - Divide it!

Codeforces Div3 #565 A - Divide it!（水题一看就懂）

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
 
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define int ll
#define INF 0x3f3f3f3f
using namespace std;
int read()
{
	int w = 1, s = 0;
	char ch = getchar();
	while (ch < '0' || ch>'9') { if (ch == '-') w = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { s = s * 10 + ch - '0';    ch = getchar(); }
	return s * w;
//最大公约数
}
int gcd(int x,int y) {
    if(x<y) swap(x,y);//很多人会遗忘，大数在前小数在后
    //递归终止条件千万不要漏了，辗转相除法
    return x % y ? gcd(y, x % y) : y;
}
int lcm(int x,int y)//计算x和y的最小公倍数
{
    return x * y / gcd(x, y);//使用公式
}
//------------------------ 以上是我常用模板与刷题几乎无关 ------------------------//
 
signed main()
{
    int n = read();
	while (n--)
	{
		int x = read(); 
		int ans = 0;
		while (x > 1)
		{
			int flag = 0;
			if (x % 5 == 0) {
			    x = x / 5 * 4;
			    flag = 1;
			}
			else if(x % 3==0) {
			     x= x / 3 * 2;
			     flag = 1;
			}
			else if (x % 2 == 0) {
			    x = x / 2;
			    flag = 1;
			}
			ans++;
			if (!flag) 
			    break;
		}
		if (x==1) 
		    printf("%lld\n",ans);
		else 
		    printf("-1\n");
	}
    return 0;
}