PYTHON

lcm in python

def lcm(x, y):
   if x > y:
       greater = x
  else:
       greater = y

  while(True):
       if((greater % x == 0) and (greater % y == 0)):
           lcm = greater
           break
        greater += 1

  return lcm

num1 =int (input("enter the first nummber: "))
num2 = int (input("enter the second number: "))

print("The L.C.M. is",lcm(num1, num2))

LCS Problem Python

/* A Naive recursive implementation of LCS problem */
#include <bits/stdc++.h>
using namespace std;
 
 
 
/* Returns length of LCS for X[0..m-1], Y[0..n-1] */
int lcs( char *X, char *Y, int m, int n )
{
    if (m == 0 || n == 0)
        return 0;
    if (X[m-1] == Y[n-1])
        return 1 + lcs(X, Y, m-1, n-1);
    else
        return max(lcs(X, Y, m, n-1), lcs(X, Y, m-1, n));
}
 
 
 
/* Driver code */
int main()
{
    char X[] = "AGGTAB";
    char Y[] = "GXTXAYB";
     
    int m = strlen(X);
    int n = strlen(Y);
     
    cout<<"Length of LCS is "<< lcs( X, Y, m, n ) ;
     
    return 0;
}
 
// This code is contributed by rathbhupendra