HDU
来源:互联网 发布:济南网络广告公司 编辑:程序博客网 时间:2024/05/29 06:56
HDU 1222 wolf and
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
ps:这道题先找一个例子找规律:比如 用一个用8个洞口的山,会发现n=1,3,5,7是不会有生存的可能的,而n=2,4,6,8是会有规律的避开一些洞口。我一开始只找到4这个就以为自己找到规律了,用m的因子去解的,结果肯定是不对啊,wa了很多次。最后又重新开始找,真的是容易犯错。
#include<cstdio>int GCD(int m,int n){if(m%n==0){return n;}elsereturn GCD(n,m%n); } int main() { int m,n,t; scanf("%d",&t); while(t--) { scanf("%d%d",&m,&n); if(GCD(m,n)==1) printf("NO\n"); else printf("YES\n"); } return 0; }
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 什么是ITSM Master?
- 每天一个linux命令(23):Linux 目录结构
- 排序算法C++&&Python实现---归并排序
- poj1860 Currency Exchange 最短路变形 spfa 判环 思考
- java i++的陷阱
- HDU
- php双引号和单引号的区别
- Git 的origin和master分析
- 设计模式---简单类工厂
- 18副用JavaScript绘制的动态艺术绘画
- 每天一个linux命令(24):Linux文件类型与扩展名
- 用aardio给python写个图形界面
- android studio targetCompatibility = '1.7' 报错 解决方案
- 数据库切分(5)之sharding实现层面的考量(使用框架还是自主开发)