Wolf and Rabbit(欧几里得)
来源:互联网 发布:webshell密码破解 编辑:程序博客网 时间:2024/05/22 01:33
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5929 Accepted Submission(s): 2977
Problem 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.
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
21 22 2
Sample Output
NOYES
Author
weigang Lee
这一题的题目让你狼每次走m个,走过k次能把0------------------n-1中所有的序号走完,问你有可能吗?
即m*k%n=0,1,2,3,4,5,6,7......n-1
假设m,n是互素的,则一定存在一个x 满足 m x mod n 分别余 k = 1,2,3,4,、、、n-1,即 mx mod n = k 有解。其中x为狼转的圈数,k为洞的
编号。说明如果m,n互素,只要这只狼足够耐心,所有的洞都会让它找一遍。。。
#include<cstdio>#include<iostream>#include<cstring>using namespace std;int exGcd(int a,int b,int &x,int &y){if(b==0){x=1;y=0;return a;// 此时a是最开始(a,b)的最大公约数,那么 gcd(a,b)*1+ 0*0=gcd(a,b),肯定对的,在这里,我认为,y可以为任何值都对}int d=exGcd(b,a%b,y,x);y-=a/b*x;return d;//返回最大公约数}int main(){ int n,m,t,x,y; cin>>t; while(t--) { cin>>n>>m; if(exGcd(n,m,x,y)==1) { cout<<"NO"<<endl; } else { cout<<"YES"<<endl; } }}
0 0
- Wolf and Rabbit(欧几里得)
- Wolf and Rabbit(最大公约数)
- Wolf and Rabbit(gcd)
- [数论]HDOJ 1222 Wolf and Rabbit 欧几里得算法
- HDU 1222(Wolf and Rabbit)
- HDU1222--Wolf and Rabbit HDU(95)
- Wolf and Rabbit (HDU 1222)
- hdu 1222 Wolf and Rabbit (GCD)
- HDU 1222 Wolf and Rabbit(数论)
- HDU 1222 Wolf and Rabbit(gcd)
- Wolf and Rabbit (GCD)【HDU】-1222
- hdu 1222 Wolf and Rabbit(gcd)
- HDU1222:Wolf and Rabbit
- 1222 Wolf and Rabbit
- Wolf and Rabbit tzc
- hdu1222-Wolf and Rabbit
- Wolf and Rabbit
- Wolf and Rabbit
- 黑马程序员—Java中的IO流
- Windows 集群
- Xcode键盘快捷键
- 济南装修
- 初识teamtoy的lazyPHP3
- Wolf and Rabbit(欧几里得)
- python中的列表(list),字典(dict),字符串(str)的基本操作
- java 构造函数的解析
- SQL Server T-SQL高级查询
- SQL Server 触发器中 Update的方法 判断一列是否更新
- 二进制的运算
- c与c++关键字的用法总结
- java基础--JDK安装与环境变量配置
- [Objective-C] 目标文件反编译得到Objecitve-C源文件