杭电 1.2.2 hide handkerchief

原创 2012年03月22日 16:25:27

原题地址: http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=1&sectionid=2&problemid=6



hide handkerchief

Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1708 Accepted Submission(s): 609
 
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
 



首先这题开始没看出来什么道道,就打算用遍历枚举的方法做,结果是堆栈溢出,数组开得太大了,于是乎不知道怎么办,所以我百度了一下,的值这题的规律是M与N互质,所以就写了这个代码~~贴上


#include<iostream>
using namespace std;
int main()
{
    int m, n, temp;
    while (cin>>m>>n)
    {
          if ((m == -1)&&(n == -1))
          break;     
          while (n != 0)
          {
                temp = n;
                n = m % n;
                m = temp;    
          }
          if (m == 1) cout<<"YES"<<endl;
          else cout<<"POOR Haha"<<endl;
    }
    system ("pause");
    return 0;
}



其实这题本身没有什么讲的,关键是我又踏回了编程之路……还有决定这段时间学习数论,感觉挺有意思的。

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

杭电OJ(HDU)-ACM Steps-Chapter Two-《Biker's Trip Odometer》《Climbing Worm》《hide handkerchief》《Nasty Hac》

杭电OJ(HDU)-ACM Steps-Chapter Two-《Biker's Trip Odometer》《Climbing Worm》《hide handkerchief》《Nasty Hac》

hdu 杭电 2104 hide handkerchief

hdu 杭电 2104 hide handkerchief hdu 杭电 2104 hide handkerchief 题目 题意:n个人围成一个圈,求手帕游戏,每一次都会跳过m-1个人,问...

杭电ACM 2104: hide handkerchief

原创作品 转载请注明出处http://blog.csdn.net/always2015/article/details/45370385这道题目刚开始没看懂,看了很久,意思是n个人围成一个圈,大家玩...

杭电OJ--1.2.2--Biker's Trip Odometer

Problem Description Most bicycle speedometers work by using a Hall Effect sensor fastened to the fr...

hdu2104 hide handkerchief(C语言)

Problem Description The Children’s Day has passed for some days .Has you remembered something happe...

hide handkerchief

杭电ACM STEP 上面的一道题。。。hidehandkerchief 题目传送门http://acm.hdu.edu.cn/game/entry/problem/show.php?chapteri...

hdu2104-hide handkerchief

题目Problem Description The Children’s Day has passed for some days .Has you remembered something hap...

HDU2104 hide handkerchief 贪心

hide handkerchief Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Other...

HDU 2104 hide handkerchief(辗转相除法--GCD)

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

hide handkerchief(第一周f题)辗转相除

Description The Children’s Day has passed for some days .Has you remembered something happened at...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)