#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; }
//bubble sort algorithm in c++ #include<bits/stdc++.h> using namespace std; void bubble_sort(int arr[],int n) { int i,j; for(i=1;i<n;i++) { for(j=0;j<n-i;j++) { if(arr[j]>arr[j+1]) { swap(arr[j],arr[j+1]); //swap is an inbuilt function } } } //time complexity is O(n^2) } int main() { int n,i; cout<<"Enter the number of elements of the array"<<endl; cin>>n; int arr[n]; for(i=0;i<n;i++) { ...
Comments
Post a Comment