HDU1222--Wolf and Rabbit HDU（95）

来源：互联网发布：linux route写入配置编辑：程序博客网时间：2024/06/05 02:52

#pragma warning(disable:4786)#include<iostream>#include<algorithm>#include<cmath>#include<stdio.h>#include<time.h>#include<stdlib.h>#include<queue>#include<set>#include<vector>#include<string>#include<ctime>#include<string.h>using namespace std;#define pi acos(-1.0)//#define LL __int64typedef long long LL;#define INF 0x7fffffffffffffff#define bug puts("hear!")#define inf 0x7fffffff#define eps 1e-10#define FRE freopen("in.txt","r",stdin)#define E exp(1.0)#define mod 1000000007int gcd(int a,int b){    return b==0?a:gcd(b,a%b);}int main(){    int n;    scanf("%d",&n);    while(n--)    {        int a,b;        scanf("%d%d",&a,&b);            if(a<b)                swap(a,b);            int flag=gcd(a,b);            if(flag==1)                printf("NO\n");            else                printf("YES\n");    }    return 0;}

简单数论。

对于每一个a，b判定一边余数。只要余数不是1就OK。

于是1A。