又見GCD
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12907 Accepted Submission(s): 5523
#include<cstdio>
int gcd(int a,int b)//求兩個數的最大公約數
{
if(b==0) return a;
else
return gcd(b,a%b);
}
int main()
{
int a,b,c,n;
scanf("%d",&n);
while(n--)
{
scanf("%d%d",&a,&b);
int c=2*b;//因爲b!=c,所以從2b開始(2b-。-)
while(gcd(a,c)!=b)//判斷條件
{
c+=b;
}
printf("%d\n",c);
}
return 0;
}