hdu - 4320 - Arcane Numbers 1 - 想法题

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>

using namespace std;

long long a,b,c;

long long gcd(long long x, long long y){
if(y == 0)
return x;
return gcd(y, x % y);
}
int main(){
int T;
scanf("%d",&T);
for(int ca = 1; ca <= T; ca ++){
scanf("%I64d%I64d",&a,&b);
printf("Case #%d: ",ca);
c = gcd(a,b);
while(c > 1){
a /= c;
c = gcd(a,b);
}
if(a == 1) puts("YES");
else puts("NO");
}
return 0;
}