asas

#include <iostream>
using namespace std;
int gcd(int m,int n){
int c = m % n;
while(c){
m = n;
n = c;
c = m % n;
}
return n;
}
int x,y,sum;
int main(){

scanf("%d%d", &x,&y);
for(int i=x;i<=y;i++){
	for(int j=x;j<=y;j++){
		if(gcd(i,j) == x && (i*j/gcd(i,j))==y){
			sum++;
		}
	}
}
printf("%d", sum);


return 0;

}
A78.最大公约数和最小公倍数问题