How to resolve the algorithm Sum multiples of 3 and 5 step by step in the Delphi programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Sum multiples of 3 and 5 step by step in the Delphi programming language
Table of Contents
Problem Statement
The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below n. Show output for n = 1000. This is is the same as Project Euler problem 1. Extra credit: do this efficiently for n = 1e20 or higher.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Sum multiples of 3 and 5 step by step in the Delphi programming language
Source code in the delphi programming language
program sum35;
{$APPTYPE CONSOLE}
var
sum: integer;
i: integer;
function isMultipleOf(aNumber, aDivisor: integer): boolean;
begin
result := aNumber mod aDivisor = 0
end;
begin
sum := 0;
for i := 3 to 999 do
begin
if isMultipleOf(i, 3) or isMultipleOf(i, 5) then
sum := sum + i;
end;
writeln(sum);
end.
You may also check:How to resolve the algorithm Taxicab numbers step by step in the Raku programming language
You may also check:How to resolve the algorithm Comments step by step in the zkl programming language
You may also check:How to resolve the algorithm Sum to 100 step by step in the Go programming language
You may also check:How to resolve the algorithm Sorting Algorithms/Circle Sort step by step in the Julia programming language
You may also check:How to resolve the algorithm Guess the number step by step in the Befunge programming language