hdu——2104——hide handkerchief
来源:互联网 发布:淘宝小二 编辑:程序博客网 时间:2024/05/07 16:03
Problem Description
The Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.
Now I introduce the game to you. Suppose there are N people played the game ,who sit on the ground forming a circle ,everyone owns a box behind them .Also there is a beautiful handkerchief hid in a box which is one of the boxes .
Then Haha(a friend of mine) is called to find the handkerchief. But he has a strange habit. Each time he will search the next box which is separated by M-1 boxes from the current box. For example, there are three boxes named A,B,C, and now Haha is at place of A. now he decide the M if equal to 2, so he will search A first, then he will search the C box, for C is separated by 2-1 = 1 box B from the current box A . Then he will search the box B ,then he will search the box A.
So after three times he establishes that he can find the beautiful handkerchief. Now I will give you N and M, can you tell me that Haha is able to find the handkerchief or not. If he can, you should tell me "YES", else tell me "POOR Haha".
Now I introduce the game to you. Suppose there are N people played the game ,who sit on the ground forming a circle ,everyone owns a box behind them .Also there is a beautiful handkerchief hid in a box which is one of the boxes .
Then Haha(a friend of mine) is called to find the handkerchief. But he has a strange habit. Each time he will search the next box which is separated by M-1 boxes from the current box. For example, there are three boxes named A,B,C, and now Haha is at place of A. now he decide the M if equal to 2, so he will search A first, then he will search the C box, for C is separated by 2-1 = 1 box B from the current box A . Then he will search the box B ,then he will search the box A.
So after three times he establishes that he can find the beautiful handkerchief. Now I will give you N and M, can you tell me that Haha is able to find the handkerchief or not. If he can, you should tell me "YES", else tell me "POOR Haha".
Input
There will be several test cases; each case input contains two integers N and M, which satisfy the relationship: 1<=M<=100000000 and 3<=N<=100000000. When N=-1 and M=-1 means the end of input case, and you should not process the data.
Output
For each input case, you should only the result that Haha can find the handkerchief or not.
Sample Input
3 2-1 -1
Sample Output
YES
题意:有n个人,如果每隔m-1个人找手绢,问最终能否找得到
#include <iostream>using namespace std;int fn(int x,int y){ int t; while(y!=0) { t=x%y; x=y; y=t; } return x;}int main(){ int n,m; while(cin>>n>>m) { if(n==-1&&m==-1) return 0; if(fn(n,m)==1) cout<<"YES"<<endl; else cout<<"POOR Haha"<<endl; } return 0;}
- HDU——2104 hide handkerchief
- hdu——2104——hide handkerchief
- HDU 2104 hide handkerchief
- hdu 2104 hide handkerchief
- HDU 2104 hide handkerchief
- hdu 2104 hide handkerchief
- HDU 2104 hide handkerchief
- hdu 2104 hide handkerchief
- Hdu 2104 hide handkerchief
- HDU 2104 hide handkerchief
- hdu 2104 hide handkerchief
- hide handkerchief HDU - 2104
- ACM刷题之HDU————hide handkerchief
- hdu acm 2104 hide handkerchief
- HDU 2104 hide handkerchief【数论】
- HDU 2104 - hide handkerchief(数论)
- hdu 2104 F - hide handkerchief
- HDU 2104 hide handkerchief (水)
- inq to sql性能优化技巧
- Android网络:开发浏览器(五)——功能完善之保存图片实现
- 在虚拟机中启动系统,出现"Operating System not found"--解决方法
- iOS 应用sendAsynchronousRequest 异步代码块下载
- TCL爱奇艺电视手机遥控器
- hdu——2104——hide handkerchief
- 战争迷雾效果 第05章 项目源码下载
- UVAlive5792 Diccionário Portuñol
- Qt QQ登录界面日志
- 随便记几点
- 二元查找树的后序遍历结果
- spring注解
- 光流法的介绍(含C++代码)_醉翁【图像理解】_百度空间
- 卡尔曼滤波推导过程