HDU 1222(数论,简单题)
2010-07-30 08:19
429 查看
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1582 Accepted Submission(s): 735
Problem Description
There is a hill with n holes around. The holes are signed from 0 to n-1.
A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise order. The first hole he get into is the one signed with 0. Then he will get into the hole every m holes. For example, m=2 and n=6, the wolf will get into the holes which are signed 0,2,4,0. If the rabbit hides in the hole which signed 1,3 or 5, she will survive. So we call these holes the safe holes.
Input
The input starts with a positive integer P which indicates the number of test cases. Then on the following P lines,each line consists 2 positive integer m and n(0<m,n<2147483648).
Output
For each input m n, if safe holes exist, you should output "YES", else output "NO" in a single line.
Sample Input
2 1 2 2 2
Sample Output
NO YES
#include <iostream> #include <algorithm> using namespace std; int gcd(int n,int m) { while(n%m!=0) { int temp; temp=m; m=n%m; n=temp; } return m; } int main() { int t,n,m; while (scanf("%d",&t)!=EOF) { while(t--) { scanf("%d%d",&n,&m); if(n<m) swap(n,m); int flag=gcd(n,m); if(flag==1) printf("NO/n"); else printf("YES/n"); } } return 0; }
相关文章推荐
- hdu 1222 Wolf and Rabbit(简单数论)
- hdu 1395 比较简单的数论题
- (step7.2.1)hdu 1395(2^x mod n = 1——简单数论)
- HDU 1222 Wolf and Rabbit(数论)
- HDU 1492 The number of divisors(约数) about Humble Numbers(数论,简单约数)
- (step7.2.3)hdu 2554(N对数的排列问题——简单数论)
- HDU 1576 A/B(数论-简单逆元)
- hdu 1222(数论)
- (step7.2.1)hdu 1395(2^x mod n = 1——简单数论)
- HDU 3818 A + B Problem 简单数论题
- hdu_1222_欧几里得_gcd简单应用_欧几里得扩展性质
- HDU - 5974 A Simple Math Problem(简单数论)
- (step7.2.4)hdu 2674(N!Again——简单数论)
- hdu 1395 2^x mod n = 1 (简单数论)
- hdu 2608 0 or 1(简单数论的题目)
- hdu 1021 Fibonacci Again(简单数论)
- hdu 1222 Wolf and Rabbit 数论,线性同余方程的一般运用
- hdu 5832 A water problem(简单数论)
- HDU 4335 What is N? 简单数论
- hdu 2114 Calculate S(n) 数论(简单题)