[水题][第一阶段-英文题试水][HDOJ-2104]hide handkerchief
来源:互联网 发布:db2查询数据库里 的表 编辑:程序博客网 时间:2024/06/07 00:14
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
import java.util.Scanner;public class Main {public static boolean fun(int n,int m){int t;t = n%m;while(t!=0){n=m;m=t;t=n%m;}if(m==1)return true;else return false;}public static void main(String[] args) {// TODO Auto-generated method stubScanner in = new Scanner(System.in);int temp,n,M,N;N=in.nextInt();M=in.nextInt();while(M!=-1&&N!=-1){if(N%M==0)System.out.println("POOR Haha");else{if(fun(N,M))System.out.println("YES");elseSystem.out.println("POOR Haha");}N=in.nextInt();M=in.nextInt();}}}
0 0
- [水题][第一阶段-英文题试水][HDOJ-2104]hide handkerchief
- HDOJ 2104 hide handkerchief(判断互质)
- hdoj 2104 hide handkerchief(辗转相除法)
- hdoj-hide handkerchief
- [水题][第一阶段-英文题试水][HDOJ-2734]Quicksum
- 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
- HACM 2104 hide handkerchief
- 2104 hide handkerchief
- hdu 2104 hide handkerchief
- hide handkerchief HDU - 2104
- [水题][第一阶段-英文题试水][HDOJ-1062]Text Reverse
- 批量修改中文文件名
- The Importance of the End to End Automation Testing Tool
- Android SDK更新 Connection to http://dl-ssl.google.com refused 解决方法
- 在Windows下搭建Android开发环境
- centos 安装 openfire
- [水题][第一阶段-英文题试水][HDOJ-2104]hide handkerchief
- [leetcode] Recover Binary Search Tree
- 让你的WordPress简单实现全站Ajax
- 大理高铁站订票热线电话是多少
- java轻量级IOC框架Guice
- 简单理解算法篇--摊还分析
- Java集合之HashMap源码实现分析
- JBoss部署Spring 4的问题
- 漫谈程序员系列:那些害死程序员的细节