#include<bits/stdc++.h> using namespace std; void fun(long long n,int count) { if(n==1) cout<< count<<endl; else if(n%2!=0 and n%3!=0 and n%5!=0) cout<<"-1"<<endl; if(n%5==0) { n=(4*n)/5; count++; fun(n,count); } else if(n%3==0) { n=(2*n)/3; count++; fun(n,count); } else if(n%2==0) { n=n/2; count++; fun(n,count); } } int main() { int q; cin>>q; for(int i=1;i<=q;i++) { long long x; cin>>x; fun(x,0); } return 0; }
#include<iostream> #include<algorithm> using namespace std; int gcd(int m,int n) { if(max(m,n)%min(m,n)==0) { return min(m,n); } else { gcd(max(m,n)%min(m,n),min(m,n)); } } int main() { int m,n; cin>>m>>n; cout<<gcd(m,n); return 0; }
Comments
Post a Comment