hdu 5505

GT and numbers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1671 Accepted Submission(s): 423

Problem Description

You are given two numbers N and M .

Every step you can get a new N in the way that multiply N by a factor of N .

Work out how many steps can N be equal to M at least.

If N can't be to M forever,print −1 .

Input

In the first line there is a number T . T is the test number.

In the next T lines there are two numbers N and M .

T≤1000 , 1≤N≤1000000 , 1≤M≤263 .

Be careful to the range of M.

You'd better print the enter in the last line when you hack others.

You'd better not print space in the last of each line when you hack others.

Output

For each test case,output an answer.

Sample Input

  
  

   
   3
1 1
1 2
2 4
  
  

Sample Output

  
  

   
   0
-1
1
  
  
  
  


  
  
  
  

   
   主要是要把N,M开到long long 大小，题意很容易理解，N需要乘以本身的因子，需要几步可以到M.
  
  
  
  


  
  
  
  

   
   
#include<stdio.h>  
long long gcd(long long a,long long b)  
{  
    if(a%b)  
        return gcd(b,a%b);  
    return b;  
}  
int main()  
{  
    int t,i,k,ans;  
    long long n,m;  
    scanf("%d",&t);  
    while(t--)  
    {  
        ans=0;  
        scanf("%I64d%I64d",&n,&m);  
        while(n!=m)  
        {  
            if(m%n)  
            {  
                puts("-1");  
                break;  
            }  
            k=gcd(m/n,n);  
            if(k==1)  
            {  
                puts("-1");  
                break;  
            }  
            n*=k;  
            ans++;  
        }  
        if(n==m)  
            printf("%d\n",ans);  
    }  
    return 0;  
}