最小公倍数与最大公约数

#include <iostream>
#include <cstdio>
using namespace std;
int gcd(int a,int b)
{
if(a<b)
{
int temp=a;
a=b;
b=temp;
}
return b==0 ? a:gcd(b,a%b);
}

int lcm(int a,int b)
{
return a*b/gcd(a,b);
}

int main()
{
int t,a,b;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&a,&b);
printf("最大公约数是%d\n",gcd(a,b));
printf("最小公倍数是%d\n",lcm(a,b));
}
return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

long long gcd(long long a,long long b)
{
if(a < b)
swap(a, b);
while(b)
{
long long t = a % b;
a = b;
b = t;
}
return a;
}

long long ngcd(long long *a, long long n)
{
if(n == 1)
return *a;
return gcd(a[n-1], ngcd(a, n-1));
}

long long lcm(long long a, long long b)
{
return a * b / gcd(a, b);
}

long long nlcm(long long *a, long long n)
{
if (n == 1)
return *a;
else
return lcm(a[n-1], nlcm(a, n-1));
}

int main()
{
int t;
cin >> t;
while(t--)
{
long long n;
cin >> n;
long long a
;
for(long long i = 0; i < n; ++i)
cin >> a[i];
cout<<"最大公约数："<<ngcd(a,n)<<endl;
cout <<"最小公倍数是："<< nlcm(a, n) << endl;
}
}