hdu 2104 hide handkerchief

最新推荐文章于 2019-08-28 22:29:17 发布

殷华

最新推荐文章于 2019-08-28 22:29:17 发布

阅读量552

点赞数

分类专栏：基础文章标签： UVA

本文链接：https://blog.csdn.net/u011639256/article/details/14455007

版权

基础专栏收录该内容

106 篇文章 0 订阅

订阅专栏

hide handkerchief

Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3831 Accepted Submission(s): 1293

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 Output

YES

Source

HDU 2007-6 Programming Contest

题意是n个人围成一圈，从当前位置开始数到第m人检查他的箱子，判断能否遍历完每个人。

重在理解题意，设m和n最大公约数为k

1、若k不等于1，则m、n的最小公倍数为m*n/k，可知，会形成一个含n/k个元素的循环，只能遍历n/k个元素，无法遍历完全。

2、若k等于1，则会形成一个含n/1=n个元素的循环，可以遍历完全。

代码如下：

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