辗转相除法求最大公约数最小公倍数

辗转相除法求最大公约数最小公倍数

辗转相除法求最大公约数最小公倍数辗转相除法求最大公约数最小公倍数辗转相除法求最大公约数最小公倍数辗转相除法求最大公约数最小公倍数

辗转相除法求最大公约数最小公倍数

#include <iostream>
#include <iomanip>
#include<algorithm>
usingnamespace std;
intmain()
{
    longlong zhanzhuan(longlong ,longlong);
    intN; cin >> N;
    while(N--)
    {
        inti, j; longlong a[1002], n,t=0,b;
        cin >> n;
        t = 0;
        for(i = 1; i <= n; i++)
        {
            cin >> a[i];
        }
        if(n == 1)
        {cout << '0'<< endl; continue; }
        for(i = 1; i <= n; i++)
        {
            for(j = i; j <= n; j++)
            {
 
                b= zhanzhuan(a[i], a[j]);
                t = t + a[i] * a[j] /b-b;
            }
        }
        t = t * 2;
        cout << t<< endl;
    }
    return0;
}
longlong zhanzhuan(longlong x,longlong y)
{
    longlong r = 1;
    if(x > y)swap(x, y);
    while(r != 0)
    {
        r = x%y;
        x = y;
        y = r;
    }
    returnx;
}