ZOJ1577(唯一分解定理）

ZOJ1577  GCD&LCM

Given x and y (2 <= x <= 100,000, 2 <= y <= 1,000,000), you are to count the number of p and q such that:

1) p and q are positive integers;

2) GCD(p, q) = x;

3) LCM(p, q) = y.

Input

x and y, one line for each test.

Output

Number of pairs of p and q.

Sample Input

3 60

Sample Output

4

    数论题，自己想不出 看了别人的思路。

           

#include<stdio.h>  
#include<algorithm>  
#include<math.h>
using namespace std;  
  
int prime[1100];  
bool flag[1100];  
  
void init()  
{  
    int i,j,num=0;  
    for(i=2;i<1100;i++)  
    {  
        if(!flag[i])  
        {  
            prime[num++]=i;  
            for(j=i*i;j<1100;j=j+i)  
                flag[j]=true;  
        }  
    }  
}  
void slove(int n)  
{  
    int i,ans=0;  
    for(i=0;prime[i]*prime[i]<=n;i++)  
    {  
        if(n%prime[i]==0)  
        {  
            ans++;  
            n=n/prime[i];  
            while(n%prime[i]==0)  
                n=n/prime[i];  
        }  
        if(n==1)  
            break;  
    }  
    if(n>1)  
        ans++;  
    printf("%d\n",(int)pow(2,ans));  
}  
  
int main()  
{  
    int x,y,n;  
    init();  
    while(scanf("%d%d",&x,&y)!=EOF)  
    {  
        if(y%x!=0)  
        {  
            printf("0\n");  
            continue;  
        }  
        n=y/x;  
        slove(n);  
    }  
    return 0;  
}