Editorial for JCC25 Contest 1 P5 - Empirical Formula
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
Author:
Find the greatest common divisor using the Euclidean Algorithm and then divide each value by the GCD. Output the new amounts.
Time Complexity: \(O(NlogMAX)\)
Comments