Richard Boegli's CnC_Generals_Zero_Hour Fork
WIP
This is documentation of Richard Boegil's Zero Hour Fork
Loading...
Searching...
No Matches
gcd_lcm.h
Go to the documentation of this file.
1
/*
2
** Command & Conquer Generals Zero Hour(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
/***********************************************************************************************
20
*** 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 ***
21
***********************************************************************************************
22
* *
23
* Project Name : G *
24
* *
25
* $Archive:: /Commando/Code/wwlib/gcd_lcm.h $*
26
* *
27
* $Author:: Greg_h $*
28
* *
29
* $Modtime:: 10/05/99 4:04p $*
30
* *
31
* $Revision:: 3 $*
32
* *
33
*---------------------------------------------------------------------------------------------*
34
* Functions: *
35
* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
36
#if _MSC_VER >= 1000
37
#pragma once
38
#endif
// _MSC_VER >= 1000
39
40
#ifndef GCD_LCM_H
41
42
#include "
always.h
"
43
44
// The greatest common divisor (GCD) is the greatest integer which is a
45
// divisor of given positive integers.
46
unsigned
int
Greatest_Common_Divisor
(
unsigned
int
a,
unsigned
int
b);
47
48
// The least common multiple (LCM) is the least integer of which given
49
// positive integers are divisors.
50
unsigned
int
Least_Common_Multiple
(
unsigned
int
a,
unsigned
int
b);
51
52
#endif
always.h
Least_Common_Multiple
unsigned int Least_Common_Multiple(unsigned int a, unsigned int b)
Definition
gcd_lcm.cpp:49
Greatest_Common_Divisor
unsigned int Greatest_Common_Divisor(unsigned int a, unsigned int b)
Definition
gcd_lcm.cpp:38
Code
Libraries
Source
WWVegas
WWLib
gcd_lcm.h
Generated by
1.13.2