"GCD and LCM codechef solution" Code Answer's
You're definitely familiar with the best coding language Whatever that developers use to develop their projects and they get all their queries like "GCD and LCM codechef solution" answered properly. Developers are finding an appropriate answer about GCD and LCM codechef solution related to the Whatever coding language. By visiting this online portal developers get answers concerning Whatever codes question like GCD and LCM codechef solution. Enter your desired code related query in the search bar and get every piece of information about Whatever code related question on GCD and LCM codechef solution.
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;
}
Source: discuss.codechef.com
All those coders who are working on the Whatever based application and are stuck on GCD and LCM codechef solution can get a collection of related answers to their query. Programmers need to enter their query on GCD and LCM codechef solution related to Whatever code and they'll get their ambiguities clear immediately. On our webpage, there are tutorials about GCD and LCM codechef solution for the programmers working on Whatever code while coding their module. Coders are also allowed to rectify already present answers of GCD and LCM codechef solution while working on the Whatever language code. Developers can add up suggestions if they deem fit any other answer relating to "GCD and LCM codechef solution". Visit this developer's friendly online web community, CodeProZone, and get your queries like GCD and LCM codechef solution resolved professionally and stay updated to the latest Whatever updates.