my first codeforces try
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
#include <iostream>
using namespace std;
bool isPrime(int n)
{
// Corner case
if (n <= 1)
return false;
// Check from 2 to n-1
for (int i = 2; i < n; i++)
if (n % i == 0)
return false;
return true;
}
int main() {
long long q;
cin>>q;
while(q!=0)
{
long long n,ct=0,x=0;
cin>>n;
while(1)
{ if(n%2==0)
{ n=n/2;
ct++;
}
else if(n%3==0)
{n=2*(n/3);
ct++;
}
else if(n%5==0)
{n=4*(n/5);
ct++;
}
if(n==1)
{
x=1;
break;
}
else if(isPrime(n)&&n!=2&&n!=3&&n!=5)
break;
}
if(x==1)
cout<<ct<<endl;
else if(x==0)
cout<<-1<<endl;
q--;
}
return 0;
}
Cpp
INFO