This Question has been **Answered**

Featured Replies

- 2
Hint ... Try finding prime factors of each number, then, gather up (multiply) all the common primes. Read More

- 1
You do not need to use seive algo here at all. Prime factors of a number can be found in sqrt(n) without the seive. You can store the count of each prime factor in an array. Initialize the HCF with the first number. Then if count of any of the … Read More

This question has already been answered. Start a new discussion instead.

Recommended Articles