zoukankan      html  css  js  c++  java
  • HDU 1222 Wolf and Rabbit(gcd)

    HDU 1222   Wolf and Rabbit   (最大公约数)解题报告

    题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=88159#problem/G

    题目:

    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
     
    题意:
    山周围有从0~n-1的n个山洞,狼按逆时针的顺序抓兔子,判断兔子是否能活下来。
     
    分析:
    这是一个求最大公约数的问题。可以用书上的gcd算法--辗转相除法。gcd(a,b)=gcd(b,a%b),还要考虑它和边界条件gcd(a,0)=a。
     
    代码:
     1 #include<cstdio>
     2 #include<iostream>
     3 using namespace std;
     4 
     5 int gcd(int a,int b)//辗转相除法
     6 {
     7     return b==0?a:gcd(b,a%b);
     8 }
     9 
    10 int main()
    11 {
    12     int p;
    13     int m,n;
    14     scanf("%d",&p);
    15     while(p--)
    16     {
    17         scanf("%d%d",&m,&n);
    18         gcd(m,n);
    19         if(gcd(m,n)==1)
    20             printf("NO
    ");
    21         else
    22             printf("YES
    ");
    23     }
    24     return 0;
    25 }
  • 相关阅读:
    8张图理解Java
    PhotoShop切图
    Java中堆内存和栈内存详解【转】
    Java编程性能优化一些事儿【转】
    Java反射机制--笔记
    JUnit单元测试--IntelliJ IDEA
    深入理解Java:自定义java注解
    基于值函数的强化学习 小例子(策略退化)
    动态规划中 策略迭代 和 值迭代 的一个小例子
    爬格子问题(经典强化学习问题) Sarsa 与 Q-Learning 的区别
  • 原文地址:https://www.cnblogs.com/ttmj865/p/4746364.html
Copyright © 2011-2022 走看看