View Code of Problem 102

#include<iostream>
#include<math.h>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int gcd(int a,int b)
{		if(b>a)
			swap(a,b);
	return a%b==0 ? b:gcd(b,a%b);
}
int main(){
	double x,y;
	while(cin>>x>>y)
	{
		double len=0,max,min;
		int num1,num2;
		for(int i=x;i<=y;i++)
		{
			num1=i;
			num2=x*y/num1;
			max=gcd(num1,num2);
			min=num1*num2/max;
			if(max==x&&min==y)
			len++;
		}
		cout<<len<<endl;
	}
	return 0;
}