Easy lcm problem , where need to store all divisors of the n (no given) and then exploit bruteforce to find lcm of which pair of the divisors is equal to n (number given)
Showing posts with label Brute Force. Show all posts
Showing posts with label Brute Force. Show all posts
Saturday, July 27, 2013
UVA 10717 Mint
Simple Prime number problem with sieve involved. Else part is brute force. Learn to use brute force seeing limits.
Subscribe to:
Posts (Atom)