zoukankan      html  css  js  c++  java
  • E

    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

    题目意思:有 n 个山洞 , 从 0 , 1, 2,----,n-1,编号; 狼从0号山洞开始,每走m步进入一次山洞,无限循环,当有山洞狼没有进入的话,说明羊是安全的;

    解法:数学题,找规律
     1 #include <iostream>
     2 
     3 using namespace std;
     4 
     5 int DP(int a,int b)
     6 {
     7     if(a==1)
     8         return 0;
     9     int n = 1;
    10     while(1)
    11     {
    12          n = b % a;
    13         if(n==0)
    14             return 1;
    15         if(n==1)
    16             return 0;
    17         b = a;
    18         a = n;
    19     }
    20 
    21 }
    22 
    23 int main()
    24 {
    25     int N;
    26     cin>>N;
    27     while(N--)
    28     {
    29         int a,b;
    30         cin>>a>>b;
    31        if(DP(a,b))
    32         cout<<"YES"<<endl;
    33        else
    34         cout<<"NO"<<endl;
    35     }
    36 
    37     return 0;
    38 }
    
    
    





  • 相关阅读:
    【模板】高斯消元
    【洛谷P1730】最小密度路径
    【模板】矩阵乘法优化线性递推
    【洛谷P3723】礼物
    【洛谷P3338】力
    【模板】NTT
    【洛谷P1919】A*B Problem升级版
    测试理论基础(思维导图)
    Fiddler
    常用 Linux 命令
  • 原文地址:https://www.cnblogs.com/a2985812043/p/7260476.html
Copyright © 2011-2022 走看看