A - Wolf and Rabbit

#include<stdio.h>
int gcd(int a,int b)
{
	return (b?gcd(b,a%b):a);//利用递归来求出最大公约数//
}
int main()
{
	int p;
	scanf("%d",&p);
	while(p--){
		int m,n;
		scanf("%d%d",&m,&n);
		printf("%s\n",gcd(m,n)==1?"NO":"YES");
	}
return 0;
}