HDU 2504 又见GCD

题目链接：点击打开链接

下面是AC代码：

/*由于b=gcd(a,c)且b != c, 所以只需遍历i*b(i = 2,3,4.....)即可 */#include <cstdlib>#include <iostream>#include <vector>#include <iterator>#include <algorithm>#include <functional>#include <list>#include <deque>#include <fstream>#include <iomanip>#include <string>#include <sstream>#include <memory.h>#include <cmath>#include <stdio.h>#include <stdlib.h>#define ll long longusing namespace std;ll Gcd(ll a, ll b){return b ? Gcd(b, a%b): a;}int main(){int T, a, b;cin >> T;while(T--){cin >> a >> b;for(int i = 2; ;i++){if(Gcd(a, i*b) == b){cout << i *b << endl;break;}}}return 0;}