水题,只是想借此记一下gcd函数的模板
#include<cstdio>
int gcd(int m,int n){return n?gcd(n,m%n):m;}
int main()
{
int n,m,t;
scanf("%d",&t);
while(t--){
scanf("%d%d",&m,&n);
if(gcd(n,m)==1) printf("NO\n");
else printf("YES\n");
}
}
关于HDU1108,lcm( m , n ) = gcd( m , n ) * ( a / gcd( m , n ) ) * ( b / gcd( m , n ) ) = m * n / gcd( m , n );
#include<cstdio>
int gcd(int m,int n){return n?gcd(n,m%n):m;}
int lcm(int m,int n){return m/gcd(m,n)*n;}
int main()
{
int n,m;
while(scanf("%d%d",&m,&n)!=EOF) printf("%d\n",lcm(m,n));
}