## The obstacle

** Provided** a

**,**

*Divisor and a Bound**Discover the biggest integer N*, Such That,

** Conditions: **

is*N**divisible by divisor*is*N**less than or equivalent to bound*is*N**higher than 0*

** Notes**

- The
passed to the function are*criteria (divisor, bound)**just favorable worths* *It’s ensured that*a**divisor is Discovered**Input” Output Examples

```
maxMultiple (2,7) ==> > return (6 )
.
```

** Description:**

** ( 6 )** is divisible by (* )( 2)

**is less than or equivalent to > bound**

*, (* )( 6)***, and**

*(7 )*

**is > 0.**

*( 6 )***Description:**

*maxMultiple( 10,50 )== > return (50).*`( 50 )`

** **

* is > divisible by ** (10 )*,** ( 50 )** is less than or equivalent to bound

**, and**

*( 50 )***is > > 0. ***

*( 50 )***Description:**

*maxMultiple( 37,200)== > return( 185 ).*```
( 185)(
*) is divisible by(* )( 37) (* ),
```

**( 185
) **

** is less than or equivalent to bound**( 200)

**( 185)**

*, and***The service in C**

*is > 0.***Choice 1:**

*#*

*int maxMultiple( int divisor, int bound) {*

** return bound/ divisor *** Choice 2:

divisor;

}

## int maxMultiple( int divisor, int bound) {<. return bound - bound % divisor; }

int maxMultiple( int divisor, int bound) {while( bound > 0) {if( bound % divisor = = 0).

break;.

else. bound–;.} return bound;.}

` Test cases to verify our service`

#

```
#include < criterion/criterion.
h >.
int maxMultiple( int divisor, int bound );.
Test( Maximum_Multiple, Check_Small_Positives).
{cr_assert_eq( maxMultiple( 2,7), 6);.
cr_assert_eq( maxMultiple( 3,10), 9);.
cr_assert_eq( maxMultiple (7,17), 14);.
} Test (Maximum_Multiple, Larger_Positives). {cr_assert_eq (maxMultiple (10,50), 50);. cr_assert_eq (maxMultiple (37,200), 185);. cr_assert_eq (maxMultiple (7,100), 98);.}
```

.