﻿ PHP Exercise: Calculate the mod of two given integers without using any inbuilt modulus operator - w3resource

# PHP Exercises: Calculate the mod of two given integers without using any inbuilt modulus operator

## PHP: Exercise-40 with Solution

Write a PHP program to calculate the mod of two given integers without using any inbuilt modulus operator.

Sample Solution: -

PHP Code:

``````<?php
function without_mod(\$m, \$n)
{
\$divides=(int)(\$m/\$n);
return \$m-\$n*\$divides;
}
echo without_mod(13, 2)."\n";
echo without_mod(81, 3)."\n";
?>
```
```

Sample Output:

```1
0
```

Flowchart: PHP Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## PHP: Tips of the Day

Mutates the original array to filter out the values specified

Example:

```<?php
function tips_pull(&\$items, ...\$params)
{
\$items = array_values(array_diff(\$items, \$params));
return \$items;
}

\$items = ['x', 'y', 'z', 'x', 'y', 'z'];
print_r(tips_pull(\$items, 'y', 'z'));
?>
```

Output:

```Array
(
 => x
 => x
)
```