zoukankan      html  css  js  c++  java
  • HDU 1222 Wolf and Rabbit(欧几里得)

    Wolf and Rabbit

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 9485    Accepted Submission(s): 4857


    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
     
    Author
    weigang Lee
     
    Source
     
    Recommend
    Ignatius.L   |   We have carefully selected several similar problems for you:  1207 1299 1219 2175 1995 
     1 #include <iostream>
     2 #include <cstring>
     3 using namespace std;
     4 int gcd(int a, int b)
     5 {
     6     int t;
     7     if (a < b) { t = a; a = b; b = t; }
     8     return b == 0 ?  a :  gcd(b, a%b);
     9 }
    10 int main()
    11 {
    12     int t;
    13     int m, n;
    14     cin >> t;
    15     while (t--)
    16     {
    17         cin >> m >> n;
    18         int d = gcd(m, n);
    19         if (d == 1) cout << "NO" << endl;
    20         else cout << "YES" << endl;
    21     }
    22     return 0;
    23 }
  • 相关阅读:
    Sigmoid函数
    Softmax分类器
    正则化惩罚项
    损失函数
    交叉验证
    超参数
    IMAGENET
    hdu 2767 Proving Equivalences 强连通
    hdu 4587 TWO NODES 关节点
    hdu 3635 Dragon Balls 并查集
  • 原文地址:https://www.cnblogs.com/caiyishuai/p/13271185.html
Copyright © 2011-2022 走看看