/* 公约数为 1, 说明可以全部走到!不解释。。。*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>using namespace std;
int gcd(int a, int b) {
return b ? gcd(b, a%b) : a;
}
int main() {
int a, b;
while(scanf("%d%d", &a, &b) == 2) {
if(a == -1 && b == -1) break;
if(gcd(a, b) == 1) {
printf("YES\n");
}
else {
printf("POOR Haha\n");
}
}
return 0;
}
hdu 2104 hide handkerchief
最新推荐文章于 2021-12-08 23:24:30 发布