CHALLENGE

ACTIVITY

$2\mathrm{.}11\mathrm{.}2$: Integer division and modulo

Jump to level $1$

Convert totalPennies to dimes, nickels, and pennies, finding the maximum number of dimes, then nickels, then pennies.

Ex: If the input is $59,$ then the output is:

Dimes: $5$

Nickels: $1$

Pennies: $4$

Note: A dime is $10$ pennies. A nickel is $5$ pennies.

int main$()\{$

int totalpennies;

int numDimes;

int numNickels;

int numPennies;

cin $$ totalPennies;

numDimes $=$ totalPennies $\frac{?}{10}$;

numPennies $=$

numNickels totalPennies &$10$;

numPennies $=$ numNickels &$5$;

cout $$ "Dimes: $"$ numDimes $$ endl;

cout $$ "Nickels: $"$ numNickels $$ endl;

cout $$ "Pennies: $"$ numPennies $$ endl;