zoukankan      html  css  js  c++  java
  • HDU Wolf and Rabbit

    Wolf and Rabbit

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 335 Accepted Submission(s): 214
    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 <stdio.h>
    using namespace std;
    int main()
    {
        int t,m,n;
        cin>>t;
        while(t--)
        {
            cin>>m>>n;
            while(n>m?(n=n%m):(m=m%n));
            if(n+m==1)printf("NO\n");
            else printf("YES\n");
        }
        return 0;
    }

  • 相关阅读:
    Travis 编译使用 JDK 的版本
    《程序员的职业素养》读书笔记
    先做人,在做事
    CAP理论
    ZGC实践
    虚拟化技术的分类及介绍
    C# AD域验证登录
    dotnet core 3.1 站点发布成windows服务
    windows 服务无法调用office word COM接口
    Ext 动态加载js文件
  • 原文地址:https://www.cnblogs.com/newpanderking/p/2120985.html
Copyright © 2011-2022 走看看