hdu_1222_欧几里得_gcd简单应用_欧几里得扩展性质
来源:互联网 发布:access sqlserver编程 编辑:程序博客网 时间:2024/06/04 18:29
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.
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;
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
Source
杭州电子科技大学第三届程序设计大赛
题意:
给你0~n-1个点(围成一个环),从0开始每m个标记m+1这个点,如果所有的点都被标记就输出YES否则NO;
解:
设 xm>n时进入新的循环;
x*m%n得到就是每次新进入循环会位移的长度,为1时就会遍历整个环
x*m%n=x*m-(x*m/n)*n=x*m+y*n=gcd(n,m)
#include<iostream>#include<cstdio>using namespace std;int x,y;int gcd(int a,int b){ return b ? gcd(b,a%b) :a;}int main(){ int a,b,t; while(cin>>t) { while(t--) { cin>>a>>b; if(gcd(a,b)==1) puts("NO"); else puts("YES"); } } return 0;}
- hdu_1222_欧几里得_gcd简单应用_欧几里得扩展性质
- NYOJ-整数性质【扩展欧几里得】
- 扩展欧几里得及其应用
- 扩展欧几里得应用分析
- 扩展欧几里得的应用
- 欧几里得扩展应用
- nyoj-775-整数性质(扩展欧几里得定理)
- 116_扩展欧几里得算法
- 【欧几里得&扩展欧几里得】
- 欧几里得和扩展欧几里得
- 欧几里得 与 扩展欧几里得
- 欧几里得&扩展欧几里得
- 欧几里得和扩展欧几里得
- 欧几里得与扩展欧几里得
- 欧几里得和扩展欧几里得
- 欧几里得 与 扩展欧几里得
- 欧几里得 扩展欧几里得
- 欧几里得与扩展欧几里得
- mybatis <forEach>标签的使用
- 双击退出程序
- 系统性能优化概述
- Redis数据结构详解(一) string
- csdn博客不再更新!有问题欢迎关注微信公众平台,见头像
- hdu_1222_欧几里得_gcd简单应用_欧几里得扩展性质
- Windows下Nginx的启动、停止等命令
- js 空数组是true还是false
- mysql的常用操作总结(数据库常用操作)
- 函数指针
- 虚拟机网络连接的三种模式
- 二.堆排序
- 【AI前沿】机器阅读理解与问答·Dynamic Co-Attention Networks
- 这也许是最具珍藏价值的Oracle DBA生存宝典!