HDU 1222 Wolf and Rabbit
2014-01-15 16:33
435 查看
题解:经过分析我们可以得到,当洞穴数与遍历间隔数互质时,一定不会有安全洞穴,所以,这就是简单的GCD的运用:
#include <cstdio> int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);} int main(){ int t; scanf("%d",&t); while(t--){ int m,n; scanf("%d%d",&m,&n); gcd(m,n)==1?printf("NO\n"):printf("YES\n"); }return 0; }
相关文章推荐
- HDU 1222 Wolf and Rabbit(数论)
- HDU 1222 Wolf and Rabbit(gcd)
- hdu 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- HDU1222--Wolf and Rabbit HDU(95)
- HDU 1222 A - Wolf and Rabbit
- hdu--1222 Wolf and Rabbit
- Wolf and Rabbit (hdu_1222) 欧几里德
- hdu 1222 Wolf and Rabbit 数论,线性同余方程的一般运用
- HDU 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- Wolf and Rabbit(hdu 1222)
- hdu 1222 Wolf and Rabbit(扩展欧几里德)
- HDU-1222-Wolf and Rabbit【GCD】
- HDU 1222 Wolf and Rabbit (扩展欧几里德应用)
- HDU 1222_Wolf and Rabbit (扩展欧几里德定理)
- HDU 1222 wolf and rabbit [gcd]
- hdu 1222 Wolf and Rabbit
- 【HDU-1222】 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit(公约数)