hdu 4497 GCD and LCM --- 2013通化邀请赛

http://blog.csdn.net/tobewhatyouwanttobe/article/details/10285863

#include<stdio.h>  
#include<string.h>  
#include<math.h>  
#include<stdlib.h>  
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
#define ll __int64
#define inf 0x3f3f3f3f
#define N 1001000

int p[N];
int main()
{
	int t,g,l,i,j,k;
	cin>>t;
	while(t--)
	{
		int cnt=0;
		cin>>g>>l;
		if(l%g!=0){
			printf("0\n");
			continue;
		}
		l/=g;
		for(i=2;i*i<=l;i++)
		{
			if(l%i==0)
			{
				p[cnt]=0;
				while(l%i==0)
				{
					p[cnt]++;
					l/=i;
				}
				cnt++;
			}
		}
		if(l!=1) p[cnt++]=1;
		ll ans=1;
		for(i=0;i<cnt;i++)
			ans*=(p[i]*6);
		cout<<ans<<endl;
	}
}