HDU 2104 hide handkerchief

http://acm.hdu.edu.cn/showproblem.php?pid=2104

最大公约数=1是YES

#include <stdio.h>
int gcd(int x,int y)
{
    return y==0?x:gcd(y,x%y);
}
int main()
{
    int m,n;
    while (scanf("%d%d",&m,&n) && m!=-1 && n!=-1)
        if (gcd(m,n)>1) printf("POOR Haha\n");
        else printf("YES\n");
}