How to resolve the algorithm Middle three digits step by step in the МК-61/52 programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Middle three digits step by step in the МК-61/52 programming language

Table of Contents

Problem Statement

Write a function/procedure/subroutine that is called with an integer value and returns the middle three digits of the integer if possible or a clear indication of an error if this is not possible. Note: The order of the middle digits should be preserved. Your function should be tested with the following values; the first line should return valid answers, those of the second line should return clear indications of an error: Show your output on this page.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Middle three digits step by step in the МК-61/52 programming language

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

П0	lg	[x]	3	-	x>=0	23	ИП0	1	0
/	[x]	^	lg	[x]	10^x	П1	/	{x}	ИП1
*	БП	00	1	+	x=0	29	ИП0	С/П	0
/


  

You may also check:How to resolve the algorithm Pascal's triangle step by step in the IDL programming language
You may also check:How to resolve the algorithm Comments step by step in the FreeBASIC programming language
You may also check:How to resolve the algorithm Arithmetic/Integer step by step in the Dyalect programming language
You may also check:How to resolve the algorithm Loops/Increment loop index within loop body step by step in the 11l programming language
You may also check:How to resolve the algorithm Pointers and references step by step in the PL/I programming language