暑期集训之最大公约数问题
来源:互联网 发布:周扬青 淘宝 编辑:程序博客网 时间:2024/06/01 07:39
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.
21 22 2
NOYES
本题的实质就是求2个数是否互质,若是,则则兔子逃不的
知道原理后就好办了,判断互质就得用到最大公约数的算法,利用最大公约数是否是一来判断互质情况,代码如下
#include<stdio.h>int gcd(int a,int b){int tep;while(b!=0){int r=b;b=a%b;a=r;}return a;}main(){int t;scanf("%d",&t);while(t--){int m,n;scanf("%d%d",&m,&n);if(gcd(n,m)==1)printf("NO\n");elseprintf("YES\n");}}
阅读全文
0 0
- 暑期集训之最大公约数问题
- 暑期集训之美素数问题
- 暑期集训之会场安排问题
- 暑期集训之最小公倍数
- 暑期集训之cake
- 暑期集训之Array
- 暑期集训之ZOJ
- 暑期集训之哈夫曼树
- 暑期集训之Subsequence
- 暑期集训之pie
- 暑期集训之Highways
- 暑期集训之感
- 暑期集训之立方求和
- 暑期集训之EXCEL排序
- 暑期集训之稳定排序
- 暑期集训之寻找大富翁
- 暑期集训之阶乘之和
- 暑期集训
- 搜索 棋盘问题
- 内存的几个小问题
- codeforces 821d Okabe and City
- 安装Python3-ipython
- NKOJ 3252 (CQOI 2015) 多项式(数学,高精度)
- 暑期集训之最大公约数问题
- jdbc 工具类的抽取
- 测试用例编写考虑的细节
- 最大公约数等几个算法
- Twitter-Snowflake,64位自增ID算法详解
- Ubuntu和windows7双系统时间错误
- String类
- 数据不平衡之SMOTE算法
- MFC创建非模态子窗口