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

    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
     
     题意:
    有n个洞 0。。n-1;
    狼从0开始每m个洞进去一次 
    问兔子是否存活,
    其实就是判断n,m的最大公约数是否为1
    仔细想想吧
    #include<iostream>
    using namespace std;
    int gcd(int a,int b){
        return b==0?a:gcd(b,a%b);
    }
    int main(){
        int t,n,m;cin>>t;
        while(t--){
            cin>>m>>n;
            if(m==1)cout<<"NO"<<endl;
            else {
                if(gcd(n,m)==1)cout<<"NO"<<endl;
                else cout<<"YES"<<endl;
            }
        }
    return 0;
    }
    View Code
     
     
  • 相关阅读:
    MSP430的IAP程序在线编程学习
    新手入门Underscore.js 中文(template)
    关于javascript中的变量声明与赋值
    DOJO复选框操作
    添加.MSPX文件(VISTA下)
    TFS集合创建
    ExtJS的导航栏(Accordion TreePanel)
    新的开始,新的起点
    MongoDB实践之路安装
    检测一个文件是否正在使用
  • 原文地址:https://www.cnblogs.com/demodemo/p/4749047.html
Copyright © 2011-2022 走看看