GCD and LCM codechef solution
#include<stdio.h>
long long gcd(long long a , long long b)
{
if(a==0)
return b;
return gcd(b%a , a);
}
int main()
{
long long t;
scanf("%lld",&t);
while(t--)
{
long long a,b,k;
scanf("%lld%lld",&a,&b);
k=gcd(a,b);
printf("%lld %lld\n",k,(a*b)/k);
}
return 0;
}gcd algorithm
function gcd(a, b)
if b = 0
return a
else
return gcd(b, a mod b)GCD and LCM
function gcd(a, b) {
let r;
while (r!=0) {
r = a % b;
a = b;
b = r
}
return a;
}
function lcm(a, b) {
return Math.abs(a*b) / gcd(a,b);
}
function solution(n, m) {
return [gcd(n,m), lcm(n,m)]
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
