Answers for "gcd lcm in optimized way python"

C++

-2

python find lcm

def lcm(a, b):
        i = 1
        if a > b:
                c = a
                d = b
        else:
                c = b
                d = a
        while True:
                if ((c * i) / d).is_integer():
                        return c * i
                i += 1;

Posted by: Guest on July-05-2020

Code answers related to "gcd lcm in optimized way python"

Code answers related to "C++"

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#