Middle three digits: Difference between revisions

← Older edit

Middle three digits (view source)

Revision as of 11:55, 25 January 2024

5,874 bytes added , 4 months ago

m

→‎{{header|Elena}}

Anonymous user

imported>Arakov

Revision as of 06:31, 8 January 2023 (view source) Psf (talk \| contribs) m (→‎{{header\|TI SR-56}}: fix wiki formatting problem) ← Older edit		Latest revision as of 11:55, 25 January 2024 (view source) imported>Arakov m (→‎{{header\|Elena}})
(18 intermediate revisions by 8 users not shown)
Line 402: -2002: Number must have an odd number of digits 0: Number must have at least 3 digits </pre> =={{header\|Amazing Hopper}}== <p>VERSION 1:</p> <syntaxhighlight lang="c"> #include <basico.h> algoritmo n=0, c="" temp = 0, candidatos={} '123, 12345, 1234567, 987654321, 10001, -10001,-123' '-100, 100, -12345,1, 2, -1, -10, 2002, -2002, 0' enlistar en 'candidatos' decimales '0' #basic{ temp = string(candidatos * sign(candidatos)) n = len( temp ) c = replicate (temp, n>=3 && not(is even(n))) toksep(NL) print (cat( lpad(" ",11,string(candidatos)), cat(" : ", copy( 3, (n/2-1), c ))),NL) } terminar </syntaxhighlight> {{out}} <pre> 123 : 123 12345 : 234 1234567 : 345 987654321 : 654 10001 : 000 -10001 : 000 -123 : 123 -100 : 100 100 : 100 -12345 : 234 1 : 2 : -1 : -10 : 2002 : -2002 : 0 : </pre> <p>VERSION 2:</p> <syntaxhighlight lang="c"> #include <basico.h> algoritmo n=0, c="", temp = 0, candidatos={} '123, 12345, 1234567, 987654321, 10001, -10001,-123' '-100, 100, -12345,1, 2, -1, -10, 2002, -2002, 0' enlistar en 'candidatos' decimales '0' tomar 'candidatos', quitar el signo convertir a cadena ---retener---, obtener largo, mover a 'n', guardar en 'temp' guardar ' replicar ( temp, #(n>=3 && not(is even(n))))' en 'c' token.separador(NL) justificar derecha(11,#(string(candidatos))), " : ", concatenar esto #( copy( 3, (n/2-1), c ) ), unir esto luego imprime terminar </syntaxhighlight> {{out}} <pre> 123 : 123 12345 : 234 1234567 : 345 987654321 : 654 10001 : 000 -10001 : 000 -123 : 123 -100 : 100 100 : 100 -12345 : 234 1 : 2 : -1 : -10 : 2002 : -2002 : 0 : </pre> <p>VERSION 3:</p> <syntaxhighlight lang="c"> #include <basico.h> algoritmo n=0, c="", m=0, candidatos={} '123, 12345, 1234567, 987654321, 10001, -10001,-123' '-100, 100, -12345,1, 2, -1, -10, 2002, -2002, 0' enlistar en 'candidatos' decimales '0' para cada elemento (v,candidatos,17) tomar'v' ---copiar en 'm'---, quitar el signo guardar en 'v' #(len( c:=(string(v)) ) ), mover a 'n' "Num: ",justificar derecha(10,#(string(m))),"(",n,")\t" si ' #( n>=3 && not(is even(n))) ' " puede ser procesado : " tomar si ( #(n==3), 'c', #( copy( 3, (n/2-1), c )) ), NL sino "no puede ser procesado\n" fin si luego imprime siguiente terminar </syntaxhighlight> {{out}} <pre> Num: 123(3) puede ser procesado : 123 Num: 12345(5) puede ser procesado : 234 Num: 1234567(7) puede ser procesado : 345 Num: 987654321(9) puede ser procesado : 654 Num: 10001(5) puede ser procesado : 000 Num: -10001(5) puede ser procesado : 000 Num: -123(3) puede ser procesado : 123 Num: -100(3) puede ser procesado : 100 Num: 100(3) puede ser procesado : 100 Num: -12345(5) puede ser procesado : 234 Num: 1(1) no puede ser procesado Num: 2(1) no puede ser procesado Num: -1(1) no puede ser procesado Num: -10(2) no puede ser procesado Num: 2002(4) no puede ser procesado Num: -2002(4) no puede ser procesado Num: 0(1) no puede ser procesado </pre> Line 1,087 ⟶ 1,237: 0: ?ONLY 1 DIGIT </pre> ==={{header\|BASIC256}}=== <syntaxhighlight lang="vb">function middleThreeDigits(n) if n < 0 then n = -n if n < 100 then return "" ## error code if n < 1000 then return string(n) if n < 10000 then return "" ns = string(n) if length(ns) mod 2 = 0 then return "" ## need to have an odd number of digits for there to be 3 middle return mid(ns, length(ns) \ 2, 3) end function dim a = {123, 12345, 1234567, 987654321, 10001, -10001, -123, -100, 100, -123451, 2, -1, -10, 2002, -2002, 0} print "The 3 middle digits of the following numbers are : " print for i = 0 to 15 result = middleThreeDigits(a[i]) print a[i]; chr(9); " => "; if result <> "" then print result else print "Error: does not have 3 middle digits" end if next</syntaxhighlight> {{out}} <pre>Similar to FreeBASIC entry.</pre> ==={{header\|BBC BASIC}}=== Line 1,287 ⟶ 1,464: -2002 length < 3 or is even 0 length < 3 or is even</pre> ==={{header\|Yabasic}}=== <syntaxhighlight lang="vb">sub middleThreeDigits$ (n) if n < 0 n = -n if n < 100 return "" // error code if n < 1000 return str$(n) if n < 10000 return "" ns$ = str$(n) if mod(len(ns$), 2) = 0 return "" // need to have an odd number of digits for there to be 3 middle return mid$(ns$, len(ns$) / 2, 3) end sub dim a(16) a(0) = 123 : a(1) = 12345 : a(2) = 1234567 a(3) = 987654321 : a(4) = 10001 : a(5) = -10001 a(6) = -123 : a(7) = -100 : a(8) = 100 a(9) = -123451 a(10) = 2 : a(11) = -1 : a(12) = -10 a(13) = 2002 : a(14) = -2002 : a(15) = 0 print "The 3 middle digits of the following numbers are : \n" for i = 1 to 16 result$ = middleThreeDigits$(a(i)) print a(i), "\t => "; if result$ <> "" then print result$ else print "Error: does not have 3 middle digits" fi next</syntaxhighlight> {{out}} <pre>Similar to FreeBASIC entry.</pre> =={{header\|Batch File}}== Line 2,360 ⟶ 2,570: =={{header\|EasyLang}}== <syntaxhighlight lang="easylang"> func$ midThreeDigits num ~~. result$~~ . trueNumber$ = abs num if (len trueNumber$ < 3) or (len trueNumber$ mod 2 = 0) ~~result~~r$ = "error" else ~~result~~r$ = substr trueNumber$ ((len trueNumber$ - 3) / 2 + 1) 3 . return r$ . numbers[] = [ 123 12345 1234567 987654321 10001 -10001 -123 -100 100 -12345 1 2 -1 -10 2002 -2002 0 ] for i in numbers[] ~~call~~print midThreeDigits i ~~result$~~ ~~print result$~~ . </syntaxhighlight> Line 2,482 ⟶ 2,692: =={{header\|Elena}}== ELENA 56.0x : <syntaxhighlight lang="elena">import system'routines; import extensions; Line 2,492 ⟶ 2,702: if(len<3) { InvalidArgumentException.new:("n must have 3 digits or more").raise() } else if(len.isEven()) { InvalidArgumentException.new:("n must have an odd number of digits").raise() }; Line 2,507 ⟶ 2,717: { new int[]{123, 12345, 1234567, 987654321, 10001, -10001, -123, -100, 100, -12345, 1, 2, -1, -10, 2002, -2002, 0} .forEach::(n) { console.printLine("middleThreeDigits(",n,"):",middleThreeDigits(n) \|\\ on::(e => e.Message)) } }</syntaxhighlight> Line 5,371 ⟶ 5,581: Staying in the real world: no number/string conversion, -1 is returned if input is invalid. {{works with\|Halcyon Calc\|4.2.7}} ≪ ABS DUP XPON ~~<syntaxhighlight lang="RPL">~~ '''IF''' DUP 2 < OVER 2 MOD OR ~~≪ ABS DUP XPON~~ '''THEN''' DROP2 -1 ~~IF DUP 2 < OVER 2 MOD OR THEN~~ '''ELSE''' 2 / 1 - ALOG / IP 1000 MOD ~~DROP2 -1~~ ~~ELSE~~ '''END''' ≫ '<span style="color:blue">→M3D</span>' STO ~~2 / 1 - ALOG / IP 1000 MOD~~ ~~END~~ ≫ ~~'→M3D' STO~~ ≪ { 123 12345 1234567 987654321 10001 -10001 -123 -100 100 -12345 -10 2002} → tl ≪ 1{ ~~tl SIZE FOR j~~} 1 tl SIZE tl'''FOR''' j ~~GET →M3D~~ tl j GET <span style="color:blue">→M3D</span> + ~~NEXT~~ '''NEXT''' ≫ ≫ ≫ EVAL ~~</syntaxhighlight>~~ {{out}} <pre> 1: { 123 234 345 654 0 0 123 100 100 234 -1 -1 } ~~12:123~~ ~~11:234~~ ~~10:345~~ ~~9:654~~ ~~8:0~~ ~~7:0~~ ~~6:123~~ ~~5:100~~ ~~4:100~~ ~~3:234~~ ~~2:-1~~ ~~1:-1~~ </pre> Line 5,619 ⟶ 5,814: No middle three No middle three </pre> =={{header\|sed}}== <syntaxhighlight lang="sed">h s/^[-+]\{0,1\}0*\([1-9]\([0-9][0-9]\)\{1,\}\)$/\1/ t l s/$/ -> error!/ b :l s/.\(.\{3,\}\)./\1/ t l x G s/\n/ -> /</syntaxhighlight> {{out}} <pre> $ printf "%s\n" -12345 -10001 -2002 -123 -100 -10 -1 0 1 2 100 123 2002 10001 12345 1234567 987654321 \| sed -f middle_three_digits.sed -12345 -> 234 -10001 -> 000 -2002 -> error! -123 -> 123 -100 -> 100 -10 -> error! -1 -> error! 0 -> error! 1 -> error! 2 -> error! 100 -> 100 123 -> 123 2002 -> error! 10001 -> 000 12345 -> 234 1234567 -> 345 987654321 -> 654 </pre> Line 5,715 ⟶ 5,944: {{trans\|Raku}} <syntaxhighlight lang="ruby">func middle_three(n) { var l = n.len; if (l < 3) { "#{n} is too short" Line 5,721 ⟶ 5,950: "#{n} has an even number of digits" } else { "The three middle digits of #{n} are: " + n.digits.ftslice((l-3 )/ 2~~, l/2 + 1~~).first(3).flip.join } } Line 5,728 ⟶ 5,957: 123 12345 1234567 987654321 10001 -10001 -123 -100 100 -12345 1 2 -1 -10 2002 -2002 0 ); nums.each { say middle_three(_) };</syntaxhighlight> {{out}} <pre> Line 6,265 ⟶ 6,494: =={{header\|Wren}}== {{libheader\|Wren-fmt}} <syntaxhighlight lang="~~ecmascript~~wren">import "./fmt" for Fmt var middle3 = Fn.new { \|n\| Line 6,282 ⟶ 6,511: for (e in a) { ~~System~~Fmt.print("~~%(Fmt.s(9~~$9d -> $n", e)), ~~-> %(~~middle3.call(e))") }</syntaxhighlight>