又见GCD
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15213 Accepted Submission(s): 6393
Problem Description
Input
第一行输入一个n,表示有n组测试数据,接下来的n行,每行输入两个正整数a,b。
Output
输出对应的c,每组测试数据占一行。
Sample Input
2
6 2
12 4
Sample Output
4
8
AC代码:
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<list>
#include<map>
#include<algorithm>
typedef long long LL;
using namespace std;
const int maxn=100;
int main()
{
int a,b,c,d,e,f,m,flag;
cin>>m;
while(m--)
{
cin>>a>>b;
c=b+b;
while(__gcd(a,c)!=b)
{
c=c+b; //让c逐渐增大
}
printf("%d\n",c);
}
return 0;
}