• 数学概念——G 最大公约数


    G - 数论,最大公约数
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
    Submit Status

    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
    解题思路:这个题目的意思就是判断输入的这两个数的最大公约数是否为1
    程序代码:
     1 #include <cstdio>
     2 using namespace std;
     3 long long hcf(long long  a,long long  b)
     4       {
     5           if(b==0)
     6             return a;
     7           else
     8             return hcf(b,a%b);
     9       }
    10 int main()
    11 {
    12     int t;
    13     long long  m,n;
    14     scanf("%d",&t);
    15     while(t--)
    16     {
    17         scanf("%d%d",&m,&n);
    18         if(hcf(m,n)==1)
    19              printf("NO
    ");
    20       else
    21              printf("YES
    ");
    22     }
    23     return 0;
    24 }
    View Code
     
     
     
    版权声明:此代码归属博主, 请务侵权!
  • 相关阅读:
    ie调试器
    修改tomcat的部署名称
    Hibernate级联操作
    eclipse 批量 查询 替换
    Hibernate包及相关工具包下载地址
    new Option及用法
    java字符串的判断
    Caused by: java.lang.ClassNotFoundException: javax.persistence.EntityListeners
    【微信公众平台开发】创建自己定义菜单(四)
    fastjson 的简单使用
  • 原文地址:https://www.cnblogs.com/www-cnxcy-com/p/4740410.html
Copyright © 2020-2023  润新知