Modulo

• Modulo operation finds the remainder when one number is divided by another

C

int a = 5, b = 3, result;
result = a % b;

C++

int a = 5, b = 3, result;
result = a % b;

Java

int a = 5, b = 3, result;
result = a % b;

Python

a, b = 5, 3
result = a % b

Example

Mr. Ali sells 153 cakes. He wants to pack these cakes into bundles of 8 cakes per bundle. How many cakes will remain unpacked?

Pseudocode

BEGIN
    INITIALIZE totalCakes as 153
    INITIALIZE cakesPerBundle as 8

    COMPUTE remainingCakes = totalCakes % cakesPerBundle

    DISPLAY "Number of cakes remaining unpacked: ", remainingCakes
END

C

int totalCakes = 153;
int cakesPerBundle = 8;
int remainingCakes = totalCakes % cakesPerBundle;

printf("Number of cakes remaining unpacked: %d\n", remainingCakes);

C++

int totalCakes = 153;
int cakesPerBundle = 8;
int remainingCakes = totalCakes % cakesPerBundle;

cout << "Number of cakes remaining unpacked: " << remainingCakes << endl;

Java

int totalCakes = 153;
int cakesPerBundle = 8;
int remainingCakes = totalCakes % cakesPerBundle;

System.out.println("Number of cakes remaining unpacked: " + remainingCakes);

Python

total_cakes = 153
cakes_per_bundle = 8
remaining_cakes = total_cakes % cakes_per_bundle

print("Number of cakes remaining unpacked: {}".format(remaining_cakes))