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
只要是输入的两个数N，M的最大公约数为1时就可以找到，否则不一定找到
#include<stdio.h> #include<math.h>
int main(){ int m,n,r=1; while(scanf("%d%d",&m,&n)!=0&&(m!=-1||n!=-1)){ while(m%n!=0){ r=m%n; m=n; n=r;
} if(n==1) printf("YES "); else printf("POOR Haha "); } return 0; }