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

    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.

    InputThe 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).
    OutputFor 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

    这是一道数学思维题目 总之就是a+b-_gcd(a,b);

    #include<iostream>
    #include<algorithm>
    using namespace std;
    typedef long long ll;
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            ll n,m;
            scanf("%lld %lld",&n,&m);
            if(__gcd(n,m)==1)
                puts("NO");
            else puts("YES");
         } 
        return 0;
     } 
  • 相关阅读:
    设置qt插件路径
    实现js与Qt程序的交互(使用QtWebkit)
    QT4与QT3的不同
    Qt5 结构及模块组成?
    最简单搜索引擎代码
    使用Bootstrap
    Lucene.Net简介和分词
    程序优化
    Host和Server的开发
    jQuery的ajax对WebApi和OData的封装
  • 原文地址:https://www.cnblogs.com/Accepting/p/11215998.html
Copyright © 2011-2022 走看看