How to resolve the algorithm Count the coins step by step in the Ring programming language

Published on 12 May 2024 09:40 PM
#Ring

How to resolve the algorithm Count the coins step by step in the Ring programming language

Table of Contents

Problem Statement

There are four types of common coins in   US   currency:

There are six ways to make change for 15 cents:

How many ways are there to make change for a dollar using these common coins?     (1 dollar = 100 cents).

Less common are dollar coins (100 cents);   and very rare are half dollars (50 cents).   With the addition of these two coins, how many ways are there to make change for $1000? (Note:   the answer is larger than   232).

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Count the coins step by step in the Ring programming language

Source code in the ring programming language

penny = 1
nickel = 1
dime = 1 
quarter = 1
count = 0
 
for penny = 0 to 100
    for nickel = 0 to 20
        for dime = 0 to 10
            for quarter = 0 to 4
                if (penny + nickel * 5 + dime * 10 + quarter * 25) = 100
                   see "" + penny + " pennies " + nickel + " nickels " + dime + " dimes " + quarter + " quarters" + nl
                   count = count + 1 
                ok
            next
        next
    next
next
see  count + " ways to make a dollar" + nl

You may also check:How to resolve the algorithm The Twelve Days of Christmas step by step in the SETL programming language
You may also check:How to resolve the algorithm Chowla numbers step by step in the Lua programming language
You may also check:How to resolve the algorithm Sorting algorithms/Merge sort step by step in the Scala programming language
You may also check:How to resolve the algorithm Case-sensitivity of identifiers step by step in the Plain English programming language
You may also check:How to resolve the algorithm Variadic function step by step in the BQN programming language