Files

BFS
BST
BackTracking
BitManipulation
Branch and Bound
DFS
DP
Data Structures
Geometry 2D
Graph
Greedy
Hashing
MachineLearning
Math
- 2Sum
- 3Sum
- 3_Sum_square_complexity
- All factors of a given Number
- AllPermutations
- Bézout's Coefficients
- Combinations
- Diophantine Eqautions
- FFT
- Factorial
- Factorization
- Fast Exponentiation with Mod
- Linear_Recurrences
- Matrix_Power
- Max_Sub_Square
- Multiplication
- NextPow2
- Palindrome
- Power
- Power_For_Huge_Num
- Prime
- Randomized algorithms
- Russain Peasants Algorithm
- Set
- TowerofHanoi
- UsefulFunctions
- Wilson's Theorem
- binomial_coefficients
- collatz_conjecture
- convexhull
- eulers_totient_function
- factors
- floor_sqrt
- gcd
- histogram_area
- isPalindrome
- largest_number_divisible_by_three
- last_digit_exp
- log
- lowest_common_multiple
  - lcm.cpp
  - lcm.py
  - lcm_using_gcd_in_Ologn.cpp
- max_divisible_num
- max_sub_rectangle
- miller_rabin_primality_test
- modular_multiplicative_inverse
- nthRoot
- pascal_row
- sieve_of_eratosthenes
- squareroot
- subset_sum
- sum_of_digits
- truncated_square_root
NetworkFlow
Search
Sorting
String
.editorconfig
.gitignore
CONTRIBUTING.md
README.md

lowest_common_multiple

Prakash-Jha-Dev

Added lcm solution with improved time complexity

Oct 29, 2018

364f782 · Oct 29, 2018

This branch is up to date with matthewsamuel95/ACM-ICPC-Algorithms:master.

Name		Name	Last commit message	Last commit date
parent directory ..
lcm.cpp		lcm.cpp	Added lcm.cpp	Oct 18, 2018
lcm.py		lcm.py	Implemented Lowest Common Multiple algorithm in Python	Oct 22, 2017
lcm_using_gcd_in_Ologn.cpp		lcm_using_gcd_in_Ologn.cpp	Added lcm solution with improved time complexity	Oct 29, 2018