C++ 解法, 执行用时: 59ms, 内存消耗: 556K, 提交时间: 2022-05-13 19:12:49

#include<bits/stdc++.h>
using namespace std;
int main(){
  long long a,b,c,i;
  int T;cin>>T;
  for(int q=1;q<=T;q++){
  cin>>a>>b;
  for(c=2*a;;c=c+a){
    if(gcd(a,b)==gcd(b,c))
      break;
  }
    cout<<c<<endl;
  }
}

pypy3 解法, 执行用时: 325ms, 内存消耗: 28736K, 提交时间: 2022-05-13 22:22:56

from math import gcd
for _ in range(int(input())):
    a, b = map(int, input().split())
    c = 2 * a 
    while True:
        if gcd(a, b) == gcd(b, c):
            break 
        c += a 
    print(c)

Python3 解法, 执行用时: 168ms, 内存消耗: 5048K, 提交时间: 2022-05-15 23:55:31

from math import gcd

for _ in range(int(input())):
    a,b=map(int,input().split())
    k=2
    while gcd(a,b)!=gcd(b,k*a):
        k+=1
    print(k*a)