gcd_lcm.cpp 2.6 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
  1. /*
  2. ** Command & Conquer Renegade(tm)
  3. ** Copyright 2025 Electronic Arts Inc.
  4. **
  5. ** This program is free software: you can redistribute it and/or modify
  6. ** it under the terms of the GNU General Public License as published by
  7. ** the Free Software Foundation, either version 3 of the License, or
  8. ** (at your option) any later version.
  9. **
  10. ** This program is distributed in the hope that it will be useful,
  11. ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. ** GNU General Public License for more details.
  14. **
  15. ** You should have received a copy of the GNU General Public License
  16. ** along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. /***********************************************************************************************
  19. *** C O N F I D E N T I A L --- W E S T W O O D S T U D I O S ***
  20. ***********************************************************************************************
  21. * *
  22. * Project Name : G *
  23. * *
  24. * $Archive:: /G/wwlib/gcd_lcm.cpp $*
  25. * *
  26. * $Author:: Naty_h $*
  27. * *
  28. * $Modtime:: 8/25/99 11:31a $*
  29. * *
  30. * $Revision:: 2 $*
  31. * *
  32. *---------------------------------------------------------------------------------------------*
  33. * Functions: *
  34. * - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
  35. #include "gcd_lcm.h"
  36. unsigned int Greatest_Common_Divisor(unsigned int a, unsigned int b)
  37. {
  38. // This uses Euclid's algorithm
  39. if (b == 0) {
  40. return a;
  41. } else {
  42. return Greatest_Common_Divisor(b, a % b);
  43. }
  44. }
  45. unsigned int Least_Common_Multiple(unsigned int a, unsigned int b)
  46. {
  47. return (a * b) / Greatest_Common_Divisor(a, b);
  48. }