GCD and LCM
#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;
}
3.89
9
function gcd(a, b)
if b = 0
return a
else
return gcd(b, a mod b)
Thank you!
9
0
3
1
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)]
}
Thank you!
1
0
Are there any code examples left?
New code examples in category Javascript
-
Javascript 2023-04-21 22:52:36
-
Javascript 2022-03-27 22:25:20 javascript download string as file
-
Javascript 2022-03-27 21:40:22 sort numbers in array javascript
-
Javascript 2022-03-27 21:20:04 compare two arrays and return the difference javascript
-
Javascript 2022-03-27 21:15:02 javascript regex french phone number
-
Javascript 2022-03-27 21:05:03 cypress custom error message
-
Javascript 2022-03-27 21:00:05 create element javascript with id
-
Javascript 2022-03-27 20:40:57 feather icons react
-
Javascript 2022-03-27 20:20:01 how to make graphql request in axios
-
Javascript 2022-03-27 20:15:07 bootstrap validator password and confirm password