BestCoder Round #60 1002

Problem Description

You are given two numbers NNN and MMM.

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

Work out how many steps can NNN be equal to MMM at least.

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

Input

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

In the next TTT lines there are two numbers NNN and MMM.

T≤1000T\leq1000T≤1000, 1≤N≤10000001\leq N \leq 10000001≤N≤1000000,1≤M≤2631 \leq M \leq 2^{63}1≤M≤2​63​​.

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

23333这道题也是够了，按题意拍也是能A的，但是一开始的想法一直WA，感觉好坑取 循环取n,m的最大公约数t 然后n*n m/t更新，后来想有可能是n*n超了Long Long
AC代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const int INF=0x3f3f3f3f;
const double eps=1e-;
typedef unsigned long long ll;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****\n");
const int MAXN=;
unsigned int n,tt,cnt,k;
ll m;
int a[MAXN];
int prime[MAXN+];
void getPrime()
{
    memset(prime,,sizeof(prime));
    for(int i = ;i <= MAXN;i++)
    {
        if(!prime[i])prime[++prime[]] = i;
        for(int j = ;j <= prime[] && prime[j] <= MAXN/i;j++)
        {
            prime[prime[j]*i] = ;
            if(i % prime[j] == )break;
        }
    }
}
long long factor[][];
int fatCnt;
int getFactors(long long x)
{
    fatCnt = ;
    long long tmp = x;
    for(int i = ; prime[i] <= tmp/prime[i];i++)
    {
        factor[fatCnt][] = ;
        if(tmp % prime[i] ==  )
        {
            factor[fatCnt][] = prime[i];
            while(tmp % prime[i] == )
            {
                factor[fatCnt][] ++;
                tmp /= prime[i];
            }
            fatCnt++;
        }
    }
    if(tmp != )
    {
        factor[fatCnt][] = tmp;
        factor[fatCnt++][] = ;
    }
    return fatCnt;
}

long long factor2[][];
int fatCnt2;
int getFactors2(long long x)
{
    fatCnt2 = ;
    long long tmp = x;
    for(int i = ; prime[i] <= tmp/prime[i];i++)
    {
        factor2[fatCnt2][] = ;
        if(tmp % prime[i] ==  )
        {
            factor2[fatCnt2][] = prime[i];
            while(tmp % prime[i] == )
            {
                factor2[fatCnt2][] ++;
                tmp /= prime[i];
            }
            fatCnt2++;
        }
    }
    if(tmp != )
    {
        factor2[fatCnt2][] = tmp;
        factor2[fatCnt2++][] = ;
    }
    return fatCnt2;
}
int main()
{
    int i;
    getPrime();
    scanf("%d",&tt);
    while(tt--)
    {
        scanf("%d %I64d",&n,&m);
        getFactors(n);
        bool flag=;
        if(m<n)
        {
            printf("-1\n");
            continue;
        }
        for(i=;i<fatCnt;i++)
        {
            int tot=;
            while(m%factor[i][]==)
            {
                m/=factor[i][];
                factor2[i][]=factor[i][];
                factor2[i][]=tot++;
            }
        }
        if(m!=)
        {
            flag=;
        }
        int Max=;
        for(i=;i<fatCnt;i++)
        {
            int temp=factor[i][];
            int tot=;
            while(temp<factor2[i][])
            {
                temp<<=;
                tot++;
            }
            Max=max(Max,tot);
        }
        if(!flag)
        {
            printf("-1\n");
        }
        else
        {
            printf("%d\n",Max);
        }
    }
}

AC

WA

#include<stdio.h>
#include<iostream>
using namespace std;
long long t,n,m;
int f,i,j;
int gcd(long long d,long long e)
{
    if(e==) return d;
    return gcd(e,d%e);
}
int main()
{
    freopen("stdin.txt","r",stdin);
    scanf("%d",&f);
    for(i=;i<=f;i++)
    {
        scanf("%I64d %I64d",&n,&m);
        if(m%n!=){cout<<"-1\n";continue;}
        if(m==n){cout<<"0\n";continue;}
        if(n==){cout<<"-1\n";continue;}
        else
        {
            m/=n;
            n*=n;
            j=;
            while()
            {
                if(m==){cout<<j<<endl;break;}
                t=gcd(n,m);cout<<t<<"* ";
                if(m!=&&t==){cout<<"-1\n";break;}
                n*=n;
                m/=t;
                j++;
            }
        }
        j=n=m=;
        t=;
    }
    return ;
}

WA