How to resolve the algorithm Count the coins step by step in the FutureBasic programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Count the coins step by step in the FutureBasic 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 FutureBasic programming language
Source code in the futurebasic programming language
include "NSLog.incl"
void local fn Doit
long penny, nickel, dime, quarter, count = 0
NSLogSetTabInterval(30)
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
NSLog(@"%ld pennies\t%ld nickels\t%ld dimes\t%ld quarters",penny,nickel,dime,quarter)
count++
end if
next quarter
next dime
next nickel
next penny
NSLog(@"\n%ld ways to make a dollar",count)
end fn
fn DoIt
HandleEvents
You may also check:How to resolve the algorithm Sieve of Eratosthenes step by step in the SparForte programming language
You may also check:How to resolve the algorithm Old Russian measure of length step by step in the ALGOL 68 programming language
You may also check:How to resolve the algorithm Loops/While step by step in the PeopleCode programming language
You may also check:How to resolve the algorithm Input loop step by step in the COBOL programming language
You may also check:How to resolve the algorithm Loops/Break step by step in the Haxe programming language