Anand Singh

#include <stdio.h>
int main()
{
int num1=25, num2=10, i, gcd;
for(i=1; i <= num1 && i <= num2; ++i)
{
// Checks if i is factor of both integers
if(num1%i==0 && num2%i==0)
gcd = i;
}
printf(“GCD of %d and %d is %d”, num1, num2, gcd);
return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
int num1=25, num2=10,i,gcd;
for(i=1; i <= num1 && i <= num2; ++i)
{
// Checks if i is factor of both integers
if(num1%i==0 && num2%i==0)
gcd = i;
}
cout << “GCD of “<< num1<<” and “<< num2<<” is “<< gcd;
return 0;
}

public class LFC
{
public static void main(String args[])
{
int num1 = 25, num2 = 10;
int gcd;
for (int i = 1; i < num1 && i < num2; i++) {
if (num1 % i == 0 && num2 % i == 0)
gcd = i;
}
System.out.println(“GCD of ” + num1 +” and ” + num2 + ” is ” + gcd);
}
}

def find_gcd(num1, num2):
# choose the smaller number
if num1 > num2:
smaller = num2
else:
smaller = num1
for i in range(1, smaller+1):
if((num1 % i == 0) and (num2 % i == 0)):
gcd = i
return gcd
num1 = 25
num2 = 10
gcd=find_gcd(num1, num2)
print (“G.C.D. of “, num1, ” and “, num2, ” is “, gcd)

function find_gcd($num1, $num2)
{
// Everything divides 0
if ($num1 == 0)
return $num2;
if ($num2 == 0)
return $num1;
// base case
if($num1 == $num2)
return $num1 ;
// a is greater
if($num1 > $num2)
return find_gcd( $num1-$num2 , $num2 ) ;
return find_gcd( $num1 , $num2-$num1 ) ;
}
// Driver code
$num1 = 25;
$num2 = 10;
echo “GCD of $num1 and $num2 is “, find_gcd($num1 , $num2) ;