HCF-Euclid-Division-Lemma C++ program to find HCF of 2 integers using Euclid's division lemma (recursive) it is an algorithm to find hcf of 2 numbers and using hcf to fnd lcm hcflcm = n1n2 .