1 solutions

  • 0
    @ 2025-12-3 16:38:14

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    long long n,x,a[60],t,maxs=1000000000000000000;
    int main()
    {
    	for(long long i=6;i<=maxs;i*=6)
    		a[++t]=i;
        cin>>n;
        while(n--)
        {
        	cin>>x;
        	if(x==1) {cout<<0<<endl;continue;}
        	int bj=0;
        	for(long long i=x,j=0;i<=maxs;i*=2,j++)
        	{
        		for(int k=1;k<=t;k++)
        		{
        			if(a[k]>i) break;
        			if(a[k]==i) {
        				cout<<k+j<<endl;
        				bj=1;
        				break;
    				}    			
    			}
        		if(bj==1) break;
    		}
        	if(bj==0) cout<<-1<<endl;
    	}
        return 0;
    }
    
    • 1

    Information

    ID
    894
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By