30 lines
446 B
C++
30 lines
446 B
C++
#include <stdio.h>
|
|
|
|
//学会辗转相除法求最大公约数
|
|
//https://blog.csdn.net/chen_zan_yu_/article/details/82943306
|
|
|
|
// 最大公约数
|
|
long long gcd(long long x,long long y)
|
|
{
|
|
long long z = y;
|
|
while(x%y!=0)
|
|
{
|
|
z = x%y;
|
|
x = y;
|
|
y = z;
|
|
}
|
|
return z;
|
|
}
|
|
|
|
int main(void) {
|
|
long long a, b, c;
|
|
scanf("%lld%lld", &a, &b);
|
|
c = gcd(a, b);
|
|
b = b / c;
|
|
if (c % b == 0)
|
|
printf("Yes\n");
|
|
else
|
|
printf("No\n");
|
|
return 0;
|
|
}
|