HDU1222

原题http://acm.hdu.edu.cn/showproblem.php?pid=1222

//多试几个例子就可以证明如果两个数的公约数只有1那么就不可以。否则可以#include <stdio.h>#include <string.h>#include <stdlib.h>#include <malloc.h>#include <ctype.h>#include <limits.h>#include <string>#include <algorithm>#include <iostream>#include <stack>#include <queue>#include <deque>#include <vector>#include <set>#include <map>using namespace std;int t;int gcd(int a,int b){int r,m,n;if(a > b){m = a;n = b;}else{m = b;n = a;}r = m%n;while(r!=0){m = n;n = r;r = m%n;}return n;}//gcd的模板int main(){int n,m;while(~scanf("%d",&t)){while(t--){scanf("%d%d",&m,&n);if(gcd(m,n)==1){printf("NO\n");}else{printf("YES\n");}}}return 0;}