hdu acm 2104 hide handkerchief

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".

 

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

分析：这题首先在理解上有点难度，一易迷惑，刚开始一直不理解查找规则，也就是第二个输入数据怎么用的，什么

 separated by M-1 boxes from the current box其实就是跳过M-1个人继续找，当然怪自己英语没学到家。

 再者这题看上去会觉得无从下手，不知道位置，要怎么样才可以判断能找到，怎么样又算找不到。想起来复杂

，往往是思维的定势，虽然这个游戏很熟悉但是我们要有区别的理解这题的题意，重心是怎么把问题转换成数学，

转换成计算机可以表示的方式。（在这点上已经吃亏了不少了）

你仔细想想，要是可以遍历每个盒子（不管找多少次），那么最终肯定可以找到手帕对吧？明白了这点，接着要解决的

的问题就是如何来根据输入的数据判断可不可以遍历每个盒子……  要想知道必须要自己写些例子突破点就着落在数字的身上了，

找找规律， 最终你会发现只要是输入的两个数N，M的最大公约数为1时就可以找到，否则不一定找到（只是在重复的位置上找）……

知道了这些，这题就变得很简单，就是运用辗转相除求最大公约数。

 #include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long N,M,r;
	while(scanf("%ld%ld",&N,&M)&&(N!=-1||M!=-1))
	{
		while(N%M!=0)//辗转相除
		{
			r=N%M;
			N=M;
			M=r;
		}
		if(M==1)
			cout<<"YES"<<endl;
		else
			cout<<"POOR Haha"<<endl;
	}
	return 0;
}