HDU 2104 hide handkerchief【数论】
来源:互联网 发布:如何运行java web程序 编辑:程序博客网 时间:2024/05/16 04:05
hide handkerchief
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3655 Accepted Submission(s): 1730
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
只有两个数的最大公约数为 1 的时候,才可能遍历到所有的位置,否则会出现循环的重复!
#include<stdio.h>int gcd(int a,int b){if(b==0){return a;}return gcd(b,a%b);}int main(){int a,b;while(scanf("%d%d",&a,&b),a!=-1&&b!=-1){if(gcd(a,b)==1){printf("YES\n");}else{printf("POOR Haha\n");}}return 0;}
0 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
- hdu acm 2104 hide handkerchief
- hdu 2104 F - hide handkerchief
- HDU 2104 hide handkerchief (水)
- HDU——2104 hide handkerchief
- hdu 杭电 2104 hide handkerchief
- (丢手绢)hdu 2104 hide handkerchief
- Ant打包Apk(上)
- Qt5链接Mysql的驱动命令
- Messager通信
- ACM解题总结——关于最长回文子串
- Oracle_取随机数函数的常用方法
- HDU 2104 hide handkerchief【数论】
- 如何解决secureCRT里面的The remote system refused the connection.
- 延云YDB版本v1.0.7-beta版本上线
- CCS的知识点
- 你不可不知的HTML优化技巧
- Dialog概述
- Leetcode234: Recover Binary Search Tree
- (转载)关于delegate 与 protocol 的理解 iOS
- 技术人才流向了哪里?