（丢手绢）hdu 2104 hide handkerchief

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

  
  

Sample Intput

  
  

   
   YES
  
  

题意：（那么水的题，被题主描述的那么绕，由于弱鸡博主读题特别差劲，怒槽一下）

n个人围成圈玩丢手绢游戏，每个人身后有个放手绢的盒子，haha搜索盒子来找手绢，zzhaha有个习惯跳过 m-1 个人搜索盒子（搜索过的盒子也可能会再次搜索，也就是初始状态永远不变），问是否能找到手绢；

思路：画图模拟，发现当 n,m 最大公约数是 1，则可以遍历所有盒子，反之不可，只会搜索出其中的某几个盒子；

#include<stdio.h>
int gcd(int a,int b)
{
	return b?gcd(b,a%b):a;
}
int main()
{
	int m,n,ans;
	while(scanf("%d %d",&m,&n)!=EOF)
	{
		if(m==n && n==-1)
		    break;
		ans=gcd(m,n);
		if(ans==1)
		{
			printf("YES\n");
		}
		else printf("POOR Haha\n");
	}
	return 0;
}