HDU--2104--hide handkerchief--解题报告(辗转相除的运用)
来源:互联网 发布:淘宝推荐系统架构 编辑:程序博客网 时间:2024/06/14 12:27
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".
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
#include<stdio.h>int main(){int gcd(int n,int m);int N,M;scanf("%d %d",&N,&M);while(N!=-1||M!=-1) //问题实质在于需要判断两个数有木有最大公约数{ if(gcd(N,M)==1)printf("YES\n");else printf("POOR Haha\n");scanf("%d %d",&N,&M);}return 0;}int gcd(int u,int v)//u是较大的数{int r;while(r=u%v){u=v;v=r;}return v;}
0 0
- HDU--2104--hide handkerchief--解题报告(辗转相除的运用)
- HDU--2104--hide handkerchief--解题报告(辗转相除的运用)
- HDU 2104 hide handkerchief(辗转相除法--GCD)
- hide handkerchief(第一周f题)辗转相除
- hdoj 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 2104 hide handkerchief (水)
- (丢手绢)hdu 2104 hide handkerchief
- hdu acm 2104 hide handkerchief
- Android Wi-Fi Display(Miracast)介绍
- eclipse出现 Some characters cannot be mapped using "GBK" character encoding 错误代码的解决办法
- oracle ORA-01033问题
- 如何实现手势识别功能?
- ios sdk小功能
- HDU--2104--hide handkerchief--解题报告(辗转相除的运用)
- jiffies计数器
- 如何用HTML5开发安卓应用
- 获取tomcat中工程的绝对路径
- 监控数据库运行情况(三)
- C# 读写XML文件封装, 直接按类来保存和读取
- iOS开发Tips2
- java.lang.NoClassDefFoundError: org/bouncycastle/jce/provider/BouncyCastleProvider
- 在Ubuntu 64位OS上运行hadoop2.2.0[重新编译hadoop]