How to resolve the algorithm Sum multiples of 3 and 5 step by step in the МК-61/52 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 МК-61/52 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 МК-61/52 programming language

Source code in the мк-61/52 programming language

П1	0	П0	3	П4	ИП4	3	/	{x}	x#0
17	ИП4	5	/	{x}	x=0	21	ИП0	ИП4	+
П0	КИП4	ИП1	ИП4	-	x=0	05	ИП0	С/П


  

You may also check:How to resolve the algorithm 100 doors step by step in the ALGOL 60 programming language
You may also check:How to resolve the algorithm Monads/Maybe monad step by step in the Kotlin programming language
You may also check:How to resolve the algorithm Real constants and functions step by step in the E programming language
You may also check:How to resolve the algorithm Hello world/Text step by step in the OOC programming language
You may also check:How to resolve the algorithm Loops/Nested step by step in the Python programming language