| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152 |
- /*
- ** Command & Conquer Renegade(tm)
- ** Copyright 2025 Electronic Arts Inc.
- **
- ** This program is free software: you can redistribute it and/or modify
- ** it under the terms of the GNU General Public License as published by
- ** the Free Software Foundation, either version 3 of the License, or
- ** (at your option) any later version.
- **
- ** This program is distributed in the hope that it will be useful,
- ** but WITHOUT ANY WARRANTY; without even the implied warranty of
- ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- ** GNU General Public License for more details.
- **
- ** You should have received a copy of the GNU General Public License
- ** along with this program. If not, see <http://www.gnu.org/licenses/>.
- */
- /***********************************************************************************************
- *** 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 ***
- ***********************************************************************************************
- * *
- * Project Name : G *
- * *
- * $Archive:: /Commando/Code/wwlib/gcd_lcm.h $*
- * *
- * $Author:: Greg_h $*
- * *
- * $Modtime:: 10/05/99 4:04p $*
- * *
- * $Revision:: 3 $*
- * *
- *---------------------------------------------------------------------------------------------*
- * Functions: *
- * - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
- #if _MSC_VER >= 1000
- #pragma once
- #endif // _MSC_VER >= 1000
- #ifndef GCD_LCM_H
- #include "always.h"
- // The greatest common divisor (GCD) is the greatest integer which is a
- // divisor of given positive integers.
- unsigned int Greatest_Common_Divisor(unsigned int a, unsigned int b);
- // The least common multiple (LCM) is the least integer of which given
- // positive integers are divisors.
- unsigned int Least_Common_Multiple(unsigned int a, unsigned int b);
- #endif
|
