Sum digits of an integer: Difference between revisions
m
Missing "4" in "1234"
(→{{header|Haskell}}: fused (sum . fmap digitToInt) to (foldr ((+) . digitToInt) 0)) |
m (Missing "4" in "1234") |
||
| (107 intermediate revisions by 46 users not shown) | |||
Line 8:
:* '''f0e'''<sub>16</sub> sums to '''29'''
<br><br>
=={{header|11l}}==
{{trans|Nim}}
<syntaxhighlight lang="11l">F sum_digits(=n, base)
V r = 0
L n > 0
r += n % base
n I/= base
R r
print(sum_digits(1, 10))
print(sum_digits(1234, 10))
print(sum_digits(F'E, 16))
print(sum_digits(0F'0E, 16))</syntaxhighlight>
{{out}}
<pre>
1
10
29
29
</pre>
=={{header|360 Assembly}}==
{{trans|REXX}}
The program uses two ASSIST macro (XDECO,XPRNT) to keep the code as short as possible.
<
SUMDIGIN CSECT
USING SUMDIGIN,R13 base register
Line 67 ⟶ 89:
XDEC DS CL12 temp
YREGS
END SUMDIGIN</
{{out}}
<pre>
Line 74 ⟶ 96:
FE 29
F0E 29
</pre>
=={{header|8086 Assembly}}==
<syntaxhighlight lang="asm"> cpu 8086
org 100h
section .text
jmp demo
;;; Sum of digits of AX in base BX.
;;; Returns: AX = result
;;; CX, DX destroyed.
digsum: xor cx,cx ; Result
.loop: xor dx,dx ; Divide AX by BX
div bx ; Quotient in AX, modulus in DX
add cx,dx ; Add digit to sum
test ax,ax ; Is the quotient now zero?
jnz .loop ; If not, keep going
mov ax,cx ; Otherwise, return
ret
;;; Print the value of AX in decimal using DOS.
;;; (Note the similarity.)
pr_ax: mov bx,num ; Number buffer pointer
mov cx,10 ; Divisor
.loop: xor dx,dx ; Get digit
div cx
add dl,'0' ; Make ASCII digit
dec bx ; Store in buffer
mov [bx],dl
test ax,ax ; More digits?
jnz .loop ; If so, keep going
mov dx,bx ; Begin of number in DX
mov ah,9 ; MS-DOS syscall 9 prints $-terminated string
int 21h
ret
;;; Run the function on the given examples
demo: mov si,tests ; Pointer to example array
.loop: lodsw ; Get base
test ax,ax ; If 0, we're done
jz .done
xchg bx,ax
lodsw ; Get number
call digsum ; Calculate sum of digits
call pr_ax ; Print sum of digits
jmp .loop ; Get next pair
.done: ret
section .data
db '*****' ; Placeholder for numeric output
num: db 13,10,'$'
tests: dw 10, 1 ; Examples
dw 10, 1234
dw 16, 0FEh
dw 16, 0F0Eh
dw 0 ; End marker</syntaxhighlight>
{{out}}
<pre>1
10
29
29</pre>
=={{header|Action!}}==
<syntaxhighlight lang="action!">CARD FUNC SumDigits(CARD num,base)
CARD res,a
res=0
WHILE num#0
DO
res==+num MOD base
num=num/base
OD
RETURN(res)
PROC Main()
CARD ARRAY data=[
1 10 1234 10 $FE 16 $F0E 16
$FF 2 0 2 2186 3 2187 3]
BYTE i
CARD num,base,res
FOR i=0 TO 15 STEP 2
DO
num=data(i)
base=data(i+1)
res=SumDigits(num,base)
PrintF("num=%U base=%U sum=%U%E",num,base,res)
OD
RETURN</syntaxhighlight>
{{out}}
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Sum_digits_of_an_integer.png Screenshot from Atari 8-bit computer]
<pre>
num=1 base=10 sum=1
num=1234 base=10 sum=10
num=254 base=16 sum=29
num=3854 base=16 sum=29
num=255 base=2 sum=8
num=0 base=2 sum=0
num=2186 base=3 sum=14
num=2187 base=3 sum=1
</pre>
Line 81 ⟶ 200:
Digits is a base-B number. E.g., 30, 10#30# 2#11110#, and 16#1E# are the same number -- either written in decimal, binary or hexadecimal notation.
<
procedure Sum_Digits is
Line 108 ⟶ 227:
Put(Sum_OF_Digits(16#fe#, 16)); -- 29
Put(Sum_OF_Digits(16#f0e#, 16)); -- 29
end Sum_Digits;</
{{out}}
Line 116 ⟶ 235:
=={{header|ALGOL 68}}==
{{works with|ALGOL 68G|Any - tested with release 2.8.win32}}
<
# operator to return the sum of the digits of an integer value in the #
# specified base #
Line 162 ⟶ 281:
)
</syntaxhighlight>
{{out}}
<pre>
Line 175 ⟶ 294:
==AppleScript==
<
--
on
script
script
on |λ|(x)
Just({x mod base, x div base})
end
sum(unfoldl(go,
end |λ|
end script
end baseDigitSum
on run
{ap(map(baseDigitSum, {2, 8, 10, 16}), {255}), ¬
ap(map(baseDigitSum, {10}), {1, 1234}), ¬
ap(map(baseDigitSum, {16}), map(readHex, {"0xfe", "0xf0e"}))}
--> {{8, 17, 12, 30}, {1, 10}, {29, 29}}
end run
-- Just :: a -> Maybe a
on Just(x)
-- Constructor for an inhabited Maybe (option type) value.
-- Wrapper containing the result of a computation.
{type:"Maybe", Nothing:false, Just:x}
end Just
-- Nothing :: Maybe a
on Nothing()
-- Constructor for an empty Maybe (option type) value.
-- Empty wrapper returned where a computation is not possible.
{type:"Maybe", Nothing:true}
end Nothing
-- Each member of a list of functions applied to
-- each of a list of arguments, deriving a list of new values
-- ap (<*>) :: [(a -> b)] -> [a] -> [b]
on ap(fs, xs)
set lst to {}
repeat with f in fs
tell mReturn(contents of f)
repeat with x in xs
set end of lst to |λ|(contents of x)
end repeat
end tell
end repeat
return lst
end ap
-- elemIndex :: Eq a => a -> [a] -> Maybe Int
on elemIndex(x, xs)
set lng to length of xs
repeat with i from 1 to lng
if x = (item i of xs) then return Just(i - 1)
end repeat
return Nothing()
end elemIndex
-- foldl :: (a -> b -> a) -> a -> [b] -> a
Line 239 ⟶ 381:
end foldl
-- foldr :: (a -> b -> b) -> b -> [a] -> b
on foldr(f, startValue, xs)
tell mReturn(f)
set lng to length of xs
repeat with i from lng to 1 by -1
set v to |λ|(item i of xs, v, i, xs)
end repeat
return v
end tell
end foldr
-- identity :: a -> a
on identity(x)
-- The argument unchanged.
x
end identity
-- map :: (a -> b) -> [a] -> [b]
on map(f, xs)
-- The list obtained by applying f
-- to each element of xs.
tell mReturn(f)
set lng to length of xs
Line 259 ⟶ 416:
end map
--
on maybe(v, f, mb)
-- Either the default value v (if mb is Nothing),
-- or the application of the function f to the
-- contents of the Just value in mb.
if Nothing of mb then
v
else
tell mReturn(f) to |λ|(Just of mb)
end if
end maybe
-- mReturn :: First-class m => (a -> b) -> m (a -> b)
on mReturn(f)
if script is class of f then
f
else
Line 271 ⟶ 442:
end mReturn
-- readHex :: String -> Int
on readHex(s)
-- The integer value of the given hexadecimal string.
set ds to "0123456789ABCDEF"
script go
on |λ|(c, a)
set {v, e} to a
set i to maybe(0, my identity, elemIndex(c, ds))
{v + (i * e), 16 * e}
end |λ|
end script
item 1 of foldr(go, {0, 1}, characters of s)
end readHex
-- sum :: [Num] -> Num
on sum(xs)
script add
on |λ|(a, b)
a + b
end |λ|
end script
foldl(add, 0, xs)
end sum
-- > unfoldl (\b -> if b == 0 then Nothing else Just (b, b-1)) 10
-- > [1,2,3,4,5,6,7,8,9,10]
-- unfoldl :: (b -> Maybe (b, a)) -> b -> [a]
on unfoldl(f, v)
set xr to {v, v} -- (value, remainder)
set xs to {}
tell mReturn(f)
repeat -- Function applied to remainder.
set mb to |λ|(item 2 of xr)
if Nothing of mb then
exit repeat
else -- New (value, remainder) tuple,
set xr to Just of mb
-- and value appended to output list.
set xs to ({item 1 of xr} & xs)
end if
end repeat
end tell
return xs
end unfoldl</syntaxhighlight>
{{Out}}
<pre>{{8, 17, 12, 30}, {1, 10}, {29, 29}}</pre>
=={{header|APL}}==
<syntaxhighlight lang="apl">sd←+/⊥⍣¯1</syntaxhighlight>
{{out}}
10 sd 12345
15
16 sd 254
29
</pre>
=={{header|ArnoldC}}==
<syntaxhighlight lang="arnoldc">LISTEN TO ME VERY CAREFULLY sumDigits
I NEED YOUR CLOTHES YOUR BOOTS AND YOUR MOTORCYCLE n
I NEED YOUR CLOTHES YOUR BOOTS AND YOUR MOTORCYCLE base
GIVE THESE PEOPLE AIR
HEY CHRISTMAS TREE sum
YOU SET US UP @I LIED
STICK AROUND n
HEY CHRISTMAS TREE digit
YOU SET US UP @I LIED
GET TO THE CHOPPER digit
HERE IS MY INVITATION n
I LET HIM GO base
ENOUGH TALK
GET TO THE CHOPPER sum
HERE IS MY INVITATION sum
GET UP digit
ENOUGH TALK
GET TO THE CHOPPER n
HERE IS MY INVITATION n
HE HAD TO SPLIT base
ENOUGH TALK
CHILL
I'LL BE BACK sum
HASTA LA VISTA, BABY
IT'S SHOWTIME
HEY CHRISTMAS TREE sum
YOU SET US UP @I LIED
GET YOUR A** TO MARS sum
DO IT NOW sumDigits 12345 10
TALK TO THE HAND "sumDigits 12345 10 ="
TALK TO THE HAND sum
GET YOUR A** TO MARS sum
DO IT NOW sumDigits 254 16
TALK TO THE HAND "sumDigits 254 16 ="
TALK TO THE HAND sum
YOU HAVE BEEN TERMINATED</syntaxhighlight>
{{out}}
<pre>
sumDigits 12345 10 =
15
sumDigits 254 16 =
29
</pre>
=={{header|Arturo}}==
{{trans|Nim}}
<syntaxhighlight lang="rebol">sumDigits: function [n base][
result: 0
while [n>0][
result: result + n%base
n: n/base
]
return result
]
print sumDigits 1 10
print sumDigits 12345 10
print sumDigits 123045 10
print sumDigits from.hex "0xfe" 16
print sumDigits from.hex "0xf0e" 16</syntaxhighlight>
{{out}}
<pre>1
15
15
29
29</pre>
=={{header|ATS}}==
<syntaxhighlight lang="ats">
(* ****** ****** *)
//
Line 343 ⟶ 630:
//
} (* end of [main0] *)
</syntaxhighlight>
{{out}}
<pre>
Line 357 ⟶ 644:
''Translated from the C version.''
<
,SumDigits(1, 10)
,SumDigits(12345, 10)
Line 378 ⟶ 665:
StringReplace,s,s,`%d, % f
return s
}</
{{out}}
<pre>1 15 15 29 29</pre>
Line 391 ⟶ 678:
Other versions of AWK may not have these limitations.
<
BEGIN {
Line 414 ⟶ 701:
return index("0123456789abcdef", tolower(dig)) - 1
}
</syntaxhighlight>
{{out}}
<pre>
Line 426 ⟶ 713:
{{works with|QBasic}}
{{works with|PowerBASIC}}
{{works with|FreeBASIC}}
{{trans|Visual Basic}}
Note that in order for this to work with the Windows versions of PowerBASIC, the test code (the block at the end containing the PRINT lines) needs to be inside <code>FUNCTION PBMAIN</code>.
<
'can handle up to base 36
DIM outp AS LONG
Line 453 ⟶ 741:
PRINT sumDigits(LTRIM$(STR$(&HFE)), 16)
PRINT sumDigits(LTRIM$(STR$(&HF0E)), 16)
PRINT sumDigits("2", 2)</
{{out}}
Line 466 ⟶ 754:
==={{header|Applesoft BASIC}}===
<
20 N$ = "1" : GOSUB 100 : PRINT N
30 N$ = "1234" : GOSUB 100 : PRINT N
Line 483 ⟶ 771:
170 N = N + J - 1
180 NEXT I
190 RETURN</
==={{header|
<syntaxhighlight lang="basic256">function SumDigits(number, nBase)
if number < 0 then number = -number
if nBase < 2 then nBase = 2
sum = 0
while number > 0
sum += number mod nBase
number /= nBase
end while
return sum
end function
print "The sums of the digits are:"
print
print "1 base 10 : "; SumDigits(1, 10)
print "1234 base 10 : "; SumDigits(1234, 10)
print "fe base 16 : "; SumDigits(0xfe, 16)
print "f0e base 16 : "; SumDigits(0xf0e, 16)
end</syntaxhighlight>
==={{header|BBC BASIC}}===
{{works with|BBC BASIC for Windows}}
This solution deliberately avoids MOD and DIV so it is not restricted to 32-bit integers.
<
PRINT "Digit sum of 1 (base 10) is "; FNdigitsum(1, 10)
PRINT "Digit sum of 12345 (base 10) is "; FNdigitsum(12345, 10)
Line 503 ⟶ 811:
n = q
ENDWHILE
= s</
{{out}}
<pre>
Line 512 ⟶ 820:
Digit sum of F0E (base 16) is 1D (base 16)
</pre>
==={{header|Chipmunk Basic}}===
{{works with|Chipmunk Basic|3.6.4}}
{{trans|BASIC256}}
<syntaxhighlight lang="qbasic">10 rem Sum digits of an integer
20 cls
30 print "The sums of the digits are:"
40 print
50 gosub 100 : print "1 base 10 : " sumdigits(1,10)
60 gosub 100 : print "1234 base 10 : ";sumdigits(1234,10)
70 gosub 100 : print "fe base 16 : " sumdigits(254,16)
80 gosub 100 : print "f0e base 16 : ";sumdigits(3854,16)
90 end
100 sub sumdigits(number,nbase)
110 if number < 0 then number = -number
120 if nbase < 2 then nbase = 2
130 sum = 0
140 while number > 0
150 sum = sum+(number-int(number/nbase)*nbase)
160 number = int(number/nbase)
170 wend
180 sumdigits = sum
190 return</syntaxhighlight><syntaxhighlight lang="scheme">
(define dsum (lambda (x base)
(let ((number (if (string? x) (string->number x base) x)))
(if (= (string-length (number->string number)) 1) number
(+ (mod number base) (dsum (div number base) base))))))
> (dsum 123 10)
6
> (dsum "fe" 16)
29
> (dsum "f0e" 16)
29
> (dsum 1234 10)
10
</syntaxhighlight>
==={{header|Craft Basic}}===
<syntaxhighlight lang="basic">define number = 0, base = 0, sum = 0
input "number: ", number
input "base: ", base
if number < 0 then
let number = number * -1
endif
if base < 2 then
let base = 2
endif
do
if number > 0 then
let sum = sum + number % base
let number = int(number / base)
endif
loop number > 0
print "sum of digits in base ", base, ": ", sum
end</syntaxhighlight>
{{out| Output}}<pre>
number: 1234567
base: 10
sum of digits in base 10: 28
</pre>
==={{header|FreeBASIC}}===
{{trans|PureBasic}}
<syntaxhighlight lang="freebasic">' FB 1.05.0 Win64
Function SumDigits(number As Integer, nBase As Integer) As Integer
If number < 0 Then number = -number ' convert negative numbers to positive
If nBase < 2 Then nBase = 2 ' nBase can't be less than 2
Dim As Integer sum = 0
While number > 0
sum += number Mod nBase
number \= nBase
Wend
Return sum
End Function
Print "The sums of the digits are:"
Print
Print "1 base 10 :"; SumDigits(1, 10)
Print "1234 base 10 :"; SumDigits(1234, 10)
Print "fe base 16 :"; SumDigits(&Hfe, 16)
Print "f0e base 16 :"; SumDigits(&Hf0e, 16)
Print
Print "Press any key to quit the program"
Sleep</syntaxhighlight>
{{out}}
<pre>
The sums of the digits are:
1 base 10 : 1
1234 base 10 : 10
fe base 16 : 29
f0e base 16 : 29
</pre>
==={{header|Gambas}}===
<syntaxhighlight lang="vbnet">Public Sub Main()
Print "The sums of the digits are:\n"
Print "1 base 10 : "; SumDigits(1, 10)
Print "1234 base 10 : "; SumDigits(1234, 10)
Print "fe base 16 : "; SumDigits(&Hfe, 16)
Print "f0e base 16 : "; SumDigits(&Hf0e, 16)
End
Function SumDigits(number As Integer, nBase As Integer) As Integer
If number < 0 Then number = -number ' convert negative numbers to positive
If nBase < 2 Then nBase = 2 ' nBase can't be less than 2
Dim sum As Integer = 0
While number > 0
sum += number Mod nBase
number \= nBase
Wend
Return sum
End Function </syntaxhighlight>
{{out}}
<pre>Same as FreeBASIC entry.</pre>
==={{header|GW-BASIC}}===
{{works with|Applesoft BASIC}}
{{works with|Chipmunk Basic}}
{{works with|PC-BASIC|any}}
{{works with|QBasic}}
{{trans|Applesoft BASIC}}
<syntaxhighlight lang="qbasic">10 REM Sum digits of an integer
20 CLS : REM 20 HOME for Applesoft BASIC
30 BASE = 10
40 N$ = "1" : GOSUB 100 : PRINT "1 base 10 : " N
50 N$ = "1234" : GOSUB 100 : PRINT "1234 base 10 : " N
60 BASE = 16
70 N$ = "FE" : GOSUB 100 : PRINT "FE base 16 : " N
80 N$ = "F0E" : GOSUB 100 : PRINT "F0E base 16 : " N
90 END
100 REM SUM DIGITS OF N$, BASE
110 IF BASE = 1 THEN N = LEN(N$) : RETURN
120 IF BASE < 2 THEN BASE = 10
130 N = 0 : V$ = LEFT$("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", BASE)
140 FOR I = 1 TO LEN(N$) : C$ = MID$(N$, I, 1)
150 FOR J = 1 TO LEN(V$)
160 IF C$ <> MID$(V$, J, 1) THEN NEXT J : N = SQR(-1) : STOP
170 N = N + J - 1
180 NEXT I
190 RETURN</syntaxhighlight>
==={{header|Minimal BASIC}}===
{{trans|Tiny BASIC}}
Only base ten is supported. Minimal BASIC does not support operations on strings (except assignment to variables).
<syntaxhighlight lang="gwbasic">
10 REM Sum digits of an integer
20 PRINT "Enter a number";
30 INPUT N
40 LET N = ABS(N)
50 LET S = 0
60 IF N = 0 THEN 100
70 LET S = S+N-10*INT(N/10)
80 LET N = INT(N/10)
90 GOTO 60
100 PRINT "Its digit sum:"; S
110 END
</syntaxhighlight>
==={{header|MSX Basic}}===
{{works with|MSX BASIC|any}}
<syntaxhighlight lang="qbasic">10 CLS
20 PRINT "The sums of the digits are:" : PRINT
30 B = 10
40 N$ = "1" : GOSUB 100 : PRINT "1 base 10 :" N
50 N$ = "1234" : GOSUB 100 : PRINT "1234 base 10 :" N
60 B = 16
70 N$ = "FE" : GOSUB 100 : PRINT "FE base 16 :" N
80 N$ = "F0E" : GOSUB 100 : PRINT "F0E base 16 :" N
90 END
100 REM SUM DIGITS OF N$, B
110 IF B = 1 THEN N = LEN(N$) : RETURN
120 IF B < 2 THEN B = 10
130 N = 0
140 V$ = LEFT$("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", B)
150 FOR I = 1 TO LEN(N$)
160 C$ = MID$(N$, I, 1)
170 FOR J = 1 TO LEN(V$)
180 IF C$ <> MID$(V$, J, 1) THEN NEXT J : N = SQR(-1) : STOP
190 N = N + J - 1
200 NEXT I
210 RETURN</syntaxhighlight>
{{out}}
<pre>Similar to FreeBASIC entry.</pre>
==={{header|Palo Alto Tiny BASIC}}===
{{trans|Tiny BASIC}}
Only base ten is supported. Palo Alto Tiny BASIC does not support operations on strings.
<syntaxhighlight lang="basic">
10 REM SUM DIGITS OF AN INTEGER
20 INPUT "ENTER A NUMBER"N
30 LET N=ABS(N),U=0
40 IF N=0 GOTO 80
50 LET U=U+N-N/10*10
60 LET N=N/10
70 GOTO 40
80 PRINT "ITS DIGIT SUM:",U
90 STOP</syntaxhighlight>
{{out}}
<pre>ENTER A NUMBER:-12321
ITS DIGIT SUM: 9</pre>
==={{header|PureBasic}}===
<syntaxhighlight lang="purebasic">EnableExplicit
Procedure.i SumDigits(Number.q, Base)
If Number < 0 : Number = -Number : EndIf; convert negative numbers to positive
If Base < 2 : Base = 2 : EndIf ; base can't be less than 2
Protected sum = 0
While Number > 0
sum + Number % Base
Number / Base
Wend
ProcedureReturn sum
EndProcedure
If OpenConsole()
PrintN("The sums of the digits are:")
PrintN("")
PrintN("1 base 10 : " + SumDigits(1, 10))
PrintN("1234 base 10 : " + SumDigits(1234, 10))
PrintN("fe base 16 : " + SumDigits($fe, 16))
PrintN("f0e base 16 : " + SumDigits($f0e, 16))
PrintN("")
PrintN("Press any key to close the console")
Repeat: Delay(10) : Until Inkey() <> ""
CloseConsole()
EndIf</syntaxhighlight>
{{out}}
<pre>
The sums of the digits are:
1 base 10 : 1
1234 base 10 : 10
fe base 16 : 29
f0e base 16 : 29
</pre>
==={{header|QBasic}}===
{{works with|QBasic|1.1}}
{{works with|QuickBasic|4.5}}
<syntaxhighlight lang="qbasic">FUNCTION SumDigits (number, nBase)
IF number < 0 THEN number = -number
IF nBase < 2 THEN nBase = 2
sum = 0
DO WHILE number > 0
sum = sum + (number MOD nBase)
number = number \ nBase
LOOP
SumDigits = sum
END FUNCTION
PRINT "The sums of the digits are:"
PRINT
PRINT "1 base 10 :"; SumDigits(1, 10)
PRINT "1234 base 10 :"; SumDigits(1234, 10)
PRINT "fe base 16 :"; SumDigits(&HFE, 16)
PRINT "f0e base 16 :"; SumDigits(&HF0E, 16)
END</syntaxhighlight>
==={{header|QuickBASIC}}===
{{works with|QBasic}}
{{works with|QB64}}
{{works with|VB-DOS}}
<syntaxhighlight lang="qbasic">DECLARE FUNCTION SumDigits% (Num AS INTEGER, NBase AS INTEGER)
CLS
PRINT "1 base 10 ->"; SumDigits%(1, 10)
PRINT "1234 base 10 ->"; SumDigits%(1234, 10)
PRINT "FE base 16 ->"; SumDigits%(&HFE, 16); " (Hex -> "; HEX$(SumDigits%(&HFE, 16)); ")"
PRINT "F0E base 16 ->"; SumDigits%(&HF0E, 16); " (Hex -> "; HEX$(SumDigits%(&HF0E, 16)); ")"
FUNCTION SumDigits% (Num AS INTEGER, NBase AS INTEGER)
' Var
DIM iSum AS INTEGER
Num = ABS(Num) ' Should be a positive number
IF NBase < 2 THEN NBase = 10 ' Default decimal
DO WHILE Num > 0
iSum = iSum + (Num MOD NBase)
Num = Num \ NBase
LOOP
SumDigits% = iSum
END FUNCTION</syntaxhighlight>
{{out}}
<pre>
1 base 10 -> 1
1234 base 10 -> 10
FE base 16 -> 11
F0E base 16 -> 20
</pre>
==={{header|Run BASIC}}===
{{trans|BASIC256}}
<syntaxhighlight lang="vb">function SumDigits(number, nBase)
if number < 0 then number = -1 * number ' convert negative numbers to positive
if nBase < 2 then nBase = 2 ' nBase can//t be less than 2
sum = 0
while number > 0
sum = sum + (number mod nBase)
number = int(number / nBase)
wend
SumDigits = sum
end function
print "The sums of the digits are:\n"
print "1 base 10 : "; SumDigits(1, 10)
print "1234 base 10 : "; SumDigits(1234, 10)
print "fe base 16 : "; SumDigits(hexdec("FE"), 16)
print "f0e base 16 : "; SumDigits(hexdec("F0E"), 16)
==={{header|TI-83 BASIC}}===
<syntaxhighlight lang="ti-83b">"01234567890ABCDEFGHIJKLMNOPQRSTUVWXYZ"→Str1
Disp "SUM DIGITS OF INT"
Disp "-----------------"
Disp "ENTER NUMBER"
Input Str2
Disp "ENTER BASE"
Input B
0→R
length(Str2)→L
For(I,1,L,1)
sub(Str2,I,1)→Str3
inString(Str1,Str3)-1→S
If S≥B or S=-1:Then
Disp "ERROR:"
Disp Str3
Disp "NOT IN BASE"
Disp B
Stop
End
R+S→R
End
Disp R</syntaxhighlight>
==={{header|Tiny BASIC}}===
Only base ten is supported because the only data type is signed 16-bit int.
<syntaxhighlight lang="tinybasic">
PRINT "Enter a number."
INPUT N
IF N < 0 THEN LET N = -N
LET S = 0
10 IF N = 0 THEN GOTO 20
LET S = S + N - 10*(N/10)
LET N = N / 10
GOTO 10
20 PRINT "Its digit sum is ",S,"."
END</syntaxhighlight>
{{out}}
<pre>Enter a number.
-11212
Its digit sum is 7.</pre>
==={{header|True BASIC}}===
<syntaxhighlight lang="qbasic">FUNCTION SumDigits(number, nBase)
IF number < 0 THEN LET number = -number
IF nBase < 2 THEN LET nBase = 2
LET sum = 0
DO WHILE number > 0
LET sum = sum + REMAINDER(number, nBase)
LET number = INT(number / nBase)
LOOP
LET SumDigits = sum
END FUNCTION
PRINT "The sums of the digits are:"
PRINT
PRINT "1 base 10 :"; SumDigits(1, 10)
PRINT "1234 base 10 :"; SumDigits(1234, 10)
PRINT "fe base 16 :"; SumDigits(254, 16) !0xfe
PRINT "f0e base 16 :"; SumDigits(3854, 16) !0xf0e
END</syntaxhighlight>
==={{header|Visual Basic}}===
This version checks that only valid digits for the indicated base are passed in, exiting otherwise.
<syntaxhighlight lang="vb">Function sumDigits(num As Variant, base As Long) As Long
'can handle up to base 36
Dim outp As Long
Dim validNums As String, tmp As Variant, x As Long, lennum As Long
'ensure num contains only valid characters
validNums = Left$("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", base)
lennum = Len(num)
For L0 = lennum To 1 Step -1
x = InStr(validNums, Mid$(num, L0, 1)) - 1
If -1 = x Then Exit Function
tmp = tmp + (x * (base ^ (lennum - L0)))
Next
While tmp
outp = outp + (tmp Mod base)
tmp = tmp \ base
Wend
sumDigits = outp
End Function
Sub tester()
Debug.Print sumDigits(1, 10)
Debug.Print sumDigits(1234, 10)
Debug.Print sumDigits(&HFE, 16)
Debug.Print sumDigits(&HF0E, 16)
Debug.Print sumDigits("2", 2)
End Sub</syntaxhighlight>
{{out}} (in the debug window):
<pre>
1
10
11
20
0
</pre>
==={{header|XBasic}}===
{{works with|Windows XBasic}}
<syntaxhighlight lang="qbasic">PROGRAM "Sum digits of an integer"
VERSION "0.0000"
DECLARE FUNCTION Entry ()
DECLARE FUNCTION SumDigits (number, nBase)
FUNCTION Entry ()
PRINT "The sums of the digits are:"
PRINT
PRINT "1 base 10 : "; SumDigits(1, 10)
PRINT "1234 base 10 : "; SumDigits(1234, 10)
PRINT "fe base 16 : "; SumDigits(0xfe, 16)
PRINT "f0e base 16 : "; SumDigits(0xf0e, 16)
END FUNCTION
FUNCTION SumDigits (number, nBase)
IF number < 0 THEN number = -number
IF nBase < 2 THEN nBase = 2
sum = 0
DO WHILE number > 0
sum = sum + (number MOD nBase)
number = number / nBase
LOOP
RETURN sum
END FUNCTION
END PROGRAM</syntaxhighlight>
==={{header|Yabasic}}===
<syntaxhighlight lang="vb">sub SumDigits(number, nBase)
if number < 0 then number = -number : fi
if nBase < 2 then nBase = 2 : fi
sum = 0
while number > 0
sum = sum + mod(number, nBase)
number = int(number / nBase)
wend
return sum
end sub
print "The sums of the digits are:\n"
print "1 base 10 : ", SumDigits(1, 10)
print "1234 base 10 : ", SumDigits(1234, 10)
print "fe base 16 : ", SumDigits(0xfe, 16)
print "f0e base 16 : ", SumDigits(0xf0e, 16)
end</syntaxhighlight>
=={{header|bc}}==
<
auto i, o, s
Line 533 ⟶ 1,324:
ibase = 16
s(FE)
s(F0E)</
{{Out}}
<pre>1
10
29
29</pre>
=={{header|BCPL}}==
<syntaxhighlight lang="bcpl">get "libhdr"
let digitsum(n, base) =
n=0 -> 0,
n rem base + digitsum(n/base, base)
let start() be
$( writef("%N*N", digitsum(1, 10)) // prints 1
writef("%N*N", digitsum(1234, 10)) // prints 10
writef("%N*N", digitsum(#1234, 8)) // also prints 10
writef("%N*N", digitsum(#XFE, 16)) // prints 29
writef("%N*N", digitsum(#XF0E, 16)) // also prints 29
$)</syntaxhighlight>
{{out}}
<pre>1
10
10
29
Line 545 ⟶ 1,357:
This solution reads the number and base as integers from stdin (in base 10). There doesn't seem any point in accepting input in other bases, because it would then have to be processed as a string and the base would be irrelevant, defeating the point of this exercise.
<
|_,#!>#:<"Base: "<
<>10g+\00g/:v:p00&
v^\p01<%g00:_55+\>
>" :muS">:#,_$\.,@</
{{out}}
Line 556 ⟶ 1,368:
Base: 10
Sum: 10</pre>
=={{header|BQN}}==
Recursive function which sums the digits of the left argument.
Default base(right argument) is 10.
<syntaxhighlight lang="bqn">SumDigits ← {
𝕊 𝕩: 10 𝕊 𝕩;
𝕨 𝕊 0: 0;
(𝕨|𝕩)+𝕨𝕊⌊𝕩÷𝕨
}
•Show SumDigits 1
•Show SumDigits 1234
•Show 16 SumDigits 254</syntaxhighlight>
<syntaxhighlight lang="text">1
10
29</syntaxhighlight>
[https://mlochbaum.github.io/BQN/try.html#code=U3VtRGlnaXRzIOKGkCB7CiAg8J2ViiDwnZWpOiAxMCDwnZWKIPCdlak7CiAg8J2VqCDwnZWKIDA6IDA7CiAgKPCdlah88J2VqSkr8J2VqPCdlYrijIrwnZWpw7fwnZWoCn0KCuKAolNob3cgU3VtRGlnaXRzIDEK4oCiU2hvdyBTdW1EaWdpdHMgMTIzNArigKJTaG93IDE2IFN1bURpZ2l0cyAyNTQ= Try It!]
=={{header|C}}==
<
int SumDigits(unsigned long long n, const int base) {
Line 575 ⟶ 1,406:
SumDigits(0xf0e, 16) );
return 0;
}</
{{out}}
<pre>1 15 15 29 29</pre>
=={{header|C sharp|C#}}==
<
{
using System;
Line 637 ⟶ 1,468:
}
}
}</
{{out}}
<pre>1
Line 646 ⟶ 1,477:
=={{header|C++}}==
<
#include <cmath>
int SumDigits(const unsigned long long int digits, const int BASE = 10) {
Line 667 ⟶ 1,498:
<< SumDigits(0xf0e, 16) << std::endl;
return 0;
}</
{{out}}
<pre>1 15 15 29 29</pre>
Line 673 ⟶ 1,504:
===Template metaprogramming version===
Tested with g++-4.6.3 (Ubuntu).
<
// Template Metaprogramming version by Martin Ettl
#include <iostream>
Line 707 ⟶ 1,538:
return 0;
}
</syntaxhighlight>
{{out}}
<pre>1 15 15 29 29</pre>
=={{header|Chez Scheme}}==
<syntaxhighlight lang="scheme">
(define dsum (lambda (x base)
(let ((number (if (string? x) (string->number x base) x)))
(if (= (string-length (number->string number)) 1) number
(+ (mod number base) (dsum (div number base) base))))))
> (dsum 123 10)
6
> (dsum "fe" 16)
29
> (dsum "f0e" 16)
29
> (dsum 1234 10)
10
</syntaxhighlight>
=={{header|Clojure}}==
<
(let [number (if-not (string? n) (Long/toString n base) n)]
(reduce + (map #(Long/valueOf (str %) base) number))))</
{{out}}
Line 735 ⟶ 1,583:
user=> (sum-digits "clojure" 32)
147</pre>
=={{header|CLU}}==
<syntaxhighlight lang="clu">% Find the digits of a number in a given base
digits = iter (n, base: int) yields (int)
while n>0 do
yield(n // base)
n := n / base
end
end digits
% Sum the digits of a number in a given base
digitsum = proc (n, base: int) returns (int)
sum: int := 0
for digit: int in digits(n, base) do
sum := sum + digit
end
return(sum)
end digitsum
start_up = proc ()
po: stream := stream$primary_output()
stream$putl(po, int$unparse(digitsum(1, 10)))
stream$putl(po, int$unparse(digitsum(1234, 10)))
stream$putl(po, int$unparse(digitsum(254, 16))) % 0xFE = 254
stream$putl(po, int$unparse(digitsum(3854, 16))) % 0xF0E = 3854
end start_up</syntaxhighlight>
{{out}}
<pre>1
10
29
29</pre>
=={{header|Common Lisp}}==
<
(loop for n = number then q
for (q r) = (multiple-value-list (truncate n base))
sum r until (zerop q)))</
Example:
<
do (format t "(~a)_~a = ~a~%" number base (sum-digits number base)))</
{{out}}
<pre>(1)_10 = 1
Line 750 ⟶ 1,630:
(3854)_16 = 29
</pre>
=={{header|Cowgol}}==
<syntaxhighlight lang="cowgol">include "cowgol.coh";
sub digitSum(n: uint32, base: uint32): (r: uint32) is
r := 0;
while n > 0 loop
r := r + n % base;
n := n / base;
end loop;
end sub;
print_i32(digitSum(1, 10)); # prints 1
print_nl();
print_i32(digitSum(1234, 10)); # prints 10
print_nl();
print_i32(digitSum(0xFE, 16)); # prints 29
print_nl();
print_i32(digitSum(0xF0E, 16)); # prints 29
print_nl();</syntaxhighlight>
{{out}}
<pre>1
10
29
29</pre>
=={{header|Crystal}}==
<
def sum_digits(base : Int) : Int32
self.chars.reduce(0) { |acc, c|
Line 764 ⟶ 1,671:
puts("1234".sum_digits 10)
puts("fe".sum_digits 16)
puts("f0e".sum_digits 16)</
{{out}}
<pre>1
Line 773 ⟶ 1,680:
=={{header|D}}==
<
uint sumDigits(T)(T n, in uint base=10) pure nothrow
Line 791 ⟶ 1,698:
sumDigits(0xf0e, 16).writeln;
1_234.BigInt.sumDigits.writeln;
}</
{{out}}
<pre>1
Line 798 ⟶ 1,705:
29
10</pre>
=={{header|Dart}}==
{{trans|FreeBASIC}}
<syntaxhighlight lang="dart">import 'dart:math';
num sumDigits(var number, var nBase) {
if (number < 0) number = -number; // convert negative numbers to positive
if (nBase < 2) nBase = 2; // nBase can't be less than 2
num sum = 0;
while (number > 0) {
sum += number % nBase;
number ~/= nBase;
}
return sum;
}
void main() {
print('The sums of the digits are:\n');
print('1 base 10 : ${sumDigits(1, 10)}');
print('1234 base 10 : ${sumDigits(1234, 10)}');
print('fe base 16 : ${sumDigits(0xfe, 16)}');
print('f0e base 16 : ${sumDigits(0xf0e, 16)}');
}</syntaxhighlight>
{{out}}
<pre>Same as FreeBASIC entry.</pre>
=={{header|Dc}}==
<
1 lS x p
Line 806 ⟶ 1,738:
16 i
FE lS x p
F0E lS x p</
{{out}}
<pre>
Line 813 ⟶ 1,745:
29
29
</pre>
=={{header|Dyalect}}==
{{trans|C#}}
<syntaxhighlight lang="dyalect">func digits(num, bas = 10) {
while num != 0 {
let (n, digit) = (num / bas, num % bas)
num = n
yield digit
}
}
func Iterator.Sum(acc = 0) {
for x in this {
acc += x
}
return acc
}
func sumOfDigits(num, bas = 10) => digits(num, bas).Sum()
for e in [
(num: 1, bas: 10),
(num: 12345, bas: 10),
(num: 123045, bas:10),
(num: 0xfe, bas: 16),
(num: 0xf0e, bas: 16)
] {
print(sumOfDigits(e.num, e.bas))
}</syntaxhighlight>
{{out}}
<pre>1
15
15
29
29</pre>
=={{header|Delphi}}==
See [https://rosettacode.org/wiki/Sum_digits_of_an_integer#Pascal Pascal].
=={{header|Draco}}==
<syntaxhighlight lang="draco">proc nonrec digitsum(word n; byte base) byte:
byte sum;
sum := 0;
while n>0 do
sum := sum + n % base;
n := n / base
od;
sum
corp
proc nonrec main() void:
writeln(digitsum(1, 10));
writeln(digitsum(1234, 10));
writeln(digitsum(0xFE, 16));
writeln(digitsum(0xF0E, 16))
corp</syntaxhighlight>
{{out}}
<pre>1
10
29
29</pre>
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
func sumdig s$ .
for c$ in strchars s$
h = strcode c$ - 48
if h >= 10
h -= 39
.
r += h
.
return r
.
print sumdig "1"
print sumdig "1234"
print sumdig "fe"
print sumdig "f0e"
</syntaxhighlight>
=={{header|EDSAC order code}}==
Numbers on the simulated input tape have to be in decimal (not a serious restriction, as pointed out in the Befunge solution). The EDSAC subroutine library didn't include a routine for integer division, so we have to write our own. In the test values, decimal 2003579 represents base-36 16xyz from Kotlin.
<syntaxhighlight lang="edsac">
[Sum of digits of a number in a given base - Rosetta Code
EDSAC program (Initial Orders 2)]
[Arrange the storage]
T45K P56F [H parameter: library subroutine R4 to read integer]
T46K P80F [N parameter: subroutine to print 35-bit positive integer]
T47K P180F [M parameter: main routine]
T48K P120F [& (Delta) parameter: subroutine for integer division]
T51K P157F [G parameter: subroutine to find sum of digits]
[Library subroutine M3, runs at load time and is then overwritten.
Prints header; here, last character sets teleprinter to figures.]
PF GK IF AF RD LF UF OF E@ A6F G@ E8F EZ PF
*!!!!NUMBER!!!!!!!BASE!!!SUM!OF!DIGITS@&#..PZ
[============== G parameter: Subroutine find sum of digits ==============
Input: 4D = non-negative number (not preserved)
6D = base (not preserved)
Output: 0D = sum of digits
Workspace: 8D (in called subroutine), 10D, 12D]
E25K TG GK
A3F T22@ [plant return link as usual]
A6D T10D [store base in 10D]
T12D [sum of digits in 12D, initialize to 0]
A4D [acc := number]
E17@ [jump into middle of loop]
[Start of loop. Next dividend is already in 4D.]
[7] TF [clear acc]
A10D T6D [pass base as divisor]
[10] A10@ G& [call division subroutine]
A4D A12D T12D [remainder is next digit; add to result]
A6D U4D [quotient becomes next dividend]
[17] S10D [is dividend >= base?]
E7@ [if so, loop back to do division]
[Here if dividend < base. Means that dividend = top digit.]
A10D [restore digit after test]
A12D [add to sum of digits]
TD [return sum of digits in 0D]
[22] ZF [(planted) jump back to caller]
[====================== M parameter: Main routine ======================]
E25K TM GK
[Load at even addess; put 35-bit values first]
[0] PF PF [number]
[2] PF PF [base]
[4] PF [negative data count]
[5] !F [space]
[6] @F [carriage return]
[7] &F [line feed]
[8] K4096F [null character]
[Enter with acc = 0]
[9] A9@ GH [call subroutine R4, sets 0D := count of (n,k) pairs]
SF [acc := count negated; it's assumed that count < 2^16]
E48@ [exit if count = 0]
LD [shift count into address field]
[14] T4@ [update negative loop counter]
[15] A15@ GH [call library subroutine R4, 0D := number]
AD T#@ [store number]
[19] A19@ GH [call library subroutine R4, 0D := base]
AD T2#@ [store base]
A#@ TD [pass number to print subroutine]
[25] A25@ GN O5@ [print number, plus space]
A2#@ TD [pass base to print subroutine]
[30] A30@ GN O5@ O5@ O5@ [print base, plus spaces]
A#@ T4D [pass number to sum-of-digits subroutine]
A2#@ T6D [same for base]
[39] A39@ GG [call subroutine, 0D := sum of digits]
[41] A41@ GN O6@ O7@ [print sum of digits, plus CR,LF]
A4@ A2F [increment negative counter]
G14@ [loop back if still negative]
[48] O8@ [done; print null to flush printer buffer]
ZF [halt the machine]
[The next 3 lines put the entry address into location 50,
so that it can be accessed via the X parameter (see end of program).]
T50K
P9@
T9Z
[================== H parameter: Library subroutine R4 ==================
Input of one signed integer, returned in 0D.
22 locations.]
E25K TH GK
GKA3FT21@T4DH6@E11@P5DJFT6FVDL4FA4DTDI4FA4FS5@G7@S5@G20@SDTDT6FEF
[============================= N parameter ==============================
Library subroutine P7, prints long strictly positive integer in 0D.
10 characters, right justified, padded left with spaces.
Even address; 35 storage locations; working position 4D.]
E25K TN
GKA3FT26@H28#@NDYFLDT4DS27@TFH8@S8@T1FV4DAFG31@SFLDUFOFFFSFL4F
T4DA1FA27@G11@XFT28#ZPFT27ZP1024FP610D@524D!FO30@SFL8FE22@
[========================== & (Delta) parameter ==========================]
[The following subroutine is not in the EDSAC library.
Division subroutine for positive 35-bit integers,
returning quotient and remainder.
Input: dividend at 4D, divisor at 6D
Output: remainder at 4D, quotient at 6D.
37 locations; working locations 0D, 8D.]
E25K T&
GKA3FT35@A6DU8DTDA4DRDSDG13@T36@ADLDE4@T36@T6DA4DSDG23@
T4DA6DYFYFT6DT36@A8DSDE35@T36@ADRDTDA6DLDT6DE15@EFPF
[==========================================================================]
[On the original EDSAC, the following (without the whitespace and comments)]
[might have been input on a separate tape.]
E25K TX GK
EZ [define entry point]
PF [acc = 0 on entry]
[Count of (n,k) pairs, then the pairs, to be read by library subroutine R4.]
[Note that sign comes *after* value.]
10+1+10+1234+10+254+16+3854+16+2186+3+2187+3+123045+50+2003579+36+
123456789+1000+1234567890+100000+
</syntaxhighlight>
{{out}}
<pre>
NUMBER BASE SUM OF DIGITS
1 10 1
1234 10 10
254 16 29
3854 16 29
2186 3 14
2187 3 1
123045 50 104
2003579 36 109
123456789 1000 1368
1234567890 100000 80235
</pre>
=={{header|Elixir}}==
<
def sumDigits(n, base\\10)
def sumDigits(n, base) when is_integer(n) do
Line 832 ⟶ 1,980:
Enum.each([{"1", 10}, {"1234", 10}, {"fe", 16}, {"f0e", 16}], fn {n,base} ->
IO.puts "#{n}(#{base}) sums to #{ RC.sumDigits(n,base) }"
end)</
{{out}}
Line 848 ⟶ 1,996:
=={{header|Emacs Lisp}}==
<syntaxhighlight lang="lisp">(defun digit-sum (n)
(apply #'+ (mapcar (lambda (c) (- c ?0)) (string-to-list "123"))))
=={{header|Erlang}}==
<
-module(sum_digits).
-export([sum_digits/2, sum_digits/1]).
Line 878 ⟶ 2,018:
sum_digits(N,B,Acc) ->
sum_digits(N div B, B, Acc + (N rem B)).
</syntaxhighlight>
Example usage:
Line 892 ⟶ 2,032:
29
</pre>
=={{header|Excel}}==
===LAMBDA===
We can define digit sums for integer strings in bases up to base 36 by binding the names '''digitSum''', '''digitValue''' to the following lambda expressions in the Name Manager of the Excel WorkBook:
(See [https://www.microsoft.com/en-us/research/blog/lambda-the-ultimatae-excel-worksheet-function/ LAMBDA: The ultimate Excel worksheet function])
{{Works with|Office 365 betas 2021}}
<syntaxhighlight lang="lisp">digitSum
=LAMBDA(s,
FOLDROW(
LAMBDA(a,
LAMBDA(c,
a + digitValue(c)
)
)
)(0)(
CHARSROW(s)
)
)
digitValue
=LAMBDA(c,
LET(
ic, UNICODE(MID(c, 1, 1)),
IF(AND(47 < ic, 58 > ic),
ic - 48,
IF(AND(64 < ic, 91 > ic),
10 + (ic - 65),
IF(AND(96 < ic, 123 > ic),
10 + (ic - 97),
0
)
)
)
)
)</syntaxhighlight>
and also assuming the following generic bindings in the Name Manager for the WorkBook:
<syntaxhighlight lang="lisp">CHARSROW
=LAMBDA(s,
MID(s,
SEQUENCE(1, LEN(s), 1, 1),
1
)
)
FOLDROW
=LAMBDA(op,
LAMBDA(a,
LAMBDA(xs,
LET(
b, op(a)(HEADROW(xs)),
IF(1 < COLUMNS(xs),
FOLDROW(op)(b)(
TAILROW(xs)
),
b
)
)
)
)
)
HEADROW
=LAMBDA(xs,
LET(REM, "The first item of each row in xs",
INDEX(
xs,
SEQUENCE(ROWS(xs)),
SEQUENCE(1, 1)
)
)
)
TAILROW
=LAMBDA(xs,
LET(REM,"The tail of each row in the grid",
n, COLUMNS(xs) - 1,
IF(0 < n,
INDEX(
xs,
SEQUENCE(ROWS(xs), 1, 1, 1),
SEQUENCE(1, n, 2, 1)
),
NA()
)
)
)</syntaxhighlight>
{{Out}}
{| class="wikitable"
|-
|||style="text-align:right; font-family:serif; font-style:italic; font-size:120%;"|fx
! colspan="2" style="text-align:left; vertical-align: bottom; font-family:Arial, Helvetica, sans-serif !important;"|=digitSum(A2)
|- style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff;"
|
| A
| B
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 1
| style="font-weight:bold" | Digit strings
| style="font-weight:bold" | Sum of digit values
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 2
| style="text-align:right" | 00
| style="text-align:right; background-color:#cbcefb" | 0
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 3
| style="text-align:right" | 1
| style="text-align:right" | 1
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 4
| style="text-align:right" | 1234
| style="text-align:right" | 10
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 5
| style="text-align:right" | fe6
| style="text-align:right" | 35
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 6
| style="text-align:right" | f0e
| style="text-align:right" | 29
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 7
| style="text-align:right" | ff
| style="text-align:right" | 30
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 8
| style="text-align:right" | gg
| style="text-align:right" | 32
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 9
| style="text-align:right" | ze7ro
| style="text-align:right" | 107
|-
| style="text-align:center; font-family:Arial, Helvetica, sans-serif !important; background-color:#000000; color:#ffffff" | 10
| style="text-align:right" | zero
| style="text-align:right" | 100
|}
=={{header|Ezhil}}==
<syntaxhighlight lang="python">
# இது ஒரு எழில் தமிழ் நிரலாக்க மொழி உதாரணம்
Line 913 ⟶ 2,204:
பதிப்பி எண்_கூட்டல்( 1289)#20
பதிப்பி எண்_கூட்டல்( 123456789)# 45
</syntaxhighlight>
=={{header|F_Sharp|F#}}==
<
let digsum b n =
Line 933 ⟶ 2,224:
show [1; 10; 1234; 10; 0xFE; 16; 0xF0E; 16] // -> 1 10 29 29
0</
===or Generically===
In order to complete the [[Digital root]] task I require a function which can handle numbers larger than 32 bit integers.
<
//Sum Digits of An Integer - Nigel Galloway: January 31st., 2015
//This code will work with any integer type
Line 943 ⟶ 2,234:
let rec sum(g, n) = if n < BASE then n+g else sum(g+n%BASE, n/BASE)
sum(LanguagePrimitives.GenericZero<_>,N)
</syntaxhighlight>
{{out}}
<pre>
Line 964 ⟶ 2,255:
Sign = 1;}
</pre>
=={{header|Factor}}==
<
{ 10 10 16 16 } { 1 1234 0xfe 0xf0e } [ sum-digits ] 2each</
{{out}}
<pre>--- Data stack:
Line 977 ⟶ 2,269:
=={{header|Forth}}==
This is an easy task for Forth, that has built in support for radices up to 36. You set the radix by storing the value in variable BASE.
<
2 base ! 11110 sum_int decimal . cr
10 base ! 12345 sum_int decimal . cr
16 base ! f0e sum_int decimal . cr</
=={{header|Fortran}}==
Line 989 ⟶ 2,281:
Other solutions ignore the representations of the input, encode digits using the base, then sum the encoding.
Both methods appear in this implementation.
<syntaxhighlight lang="fortran">
!-*- mode: compilation; default-directory: "/tmp/" -*-
!Compilation started at Fri Jun 7 21:00:12
Line 1,081 ⟶ 2,373:
end subroutine process0
end program digit_sum
</syntaxhighlight>
=={{header|
In Frink numbers can be specifed to an arbitrary base from 2 to 36 as <CODE>number\\base</CODE>. The function <CODE>integerDigits[n, base]</CODE> lists the digits of <CODE>n</CODE> in the base <CODE>base</CODE>.
<syntaxhighlight lang="frink">sumDigits[n, base=10] := sum[integerDigits[n, base]]</syntaxhighlight>
The sample problems can be written as:
<syntaxhighlight lang="frink">
sumDigits[1]
sumDigits[1234]
sumDigits[fe\\16]
sumDigits[f03\\16]
</syntaxhighlight>
=={{header|Fōrmulæ}}==
{{FormulaeEntry|page=https://formulae.org/?script=examples/Sum_digits_of_an_integer}}
'''Solution'''
[[File:Fōrmulæ - Sum digits of an integer 01.png]]
'''Test cases'''
[[File:Fōrmulæ - Sum digits of an integer 02.png]]
[[File:Fōrmulæ - Sum digits of an integer 03.png]]
[[File:Fōrmulæ - Sum digits of an integer 04.png]]
[[File:Fōrmulæ - Sum digits of an integer 05.png]]
[[File:Fōrmulæ - Sum digits of an integer 06.png]]
[[File:Fōrmulæ - Sum digits of an integer 07.png]]
[[File:Fōrmulæ - Sum digits of an integer 08.png]]
[[File:Fōrmulæ - Sum digits of an integer 07.png]]
=={{header|Go}}==
Handling numbers up to 2^64-1 and bases from 2 to 36 is pretty easy, larger values can be handled using the <code>math/big</code> package (but it's still limited to base<=36).
<
package digit
Line 1,160 ⟶ 2,455:
}
return
}</
<
package digit
Line 1,211 ⟶ 2,506:
t.Log("got expected error:", err)
}
}</
=={{header|Golfscript}}==
<syntaxhighlight lang="golfscript">{base {+}*}:sd;</syntaxhighlight>
Test (apply sd for each array [number radix]) :
{{out}}
<pre>[[1 10] [1234 10] [254 16] [3854 16]] {~sd p}%
1
10
29
29
</pre>
=={{header|Groovy}}==
Solution:
<
Integer.toString(number, radix).collect { Integer.parseInt(it, radix) }.sum()
}</
Test:
<
println """
Decimal value: ${it[0]}
Line 1,228 ⟶ 2,537:
Radix Digit Sum: ${Integer.toString(digitsum(it[0], it[1]), it[1])}
"""
}</
{{out}}
Line 1,280 ⟶ 2,589:
=={{header|Haskell}}==
<
:: Integral a
=> a -> a -> a
Line 1,291 ⟶ 2,600:
main :: IO ()
main = print $ digsum 16 255 -- "FF": 15 + 15 = 30</
{{Out}}
<pre>30</pre>
In terms of unfoldr:
<syntaxhighlight lang="haskell">import Data.List (unfoldr)
import Data.Tuple (swap)
----------------- SUM DIGITS OF AN INTEGER ---------------
baseDigitSum :: Int -> Int -> Int
baseDigitSum base = sum . unfoldr go
where
go x
| 0 < x = (Just . swap) $ quotRem x base
| otherwise = Nothing
-------------------------- TESTS -------------------------
main :: IO ()
main =
mapM_
print
[ baseDigitSum <$> [2, 8, 10, 16] <*> [255],
baseDigitSum <$> [10] <*> [1, 1234],
baseDigitSum <$> [16] <*> [0xfe, 0xf0e]
]</syntaxhighlight>
{{Out}}
<pre>[8,17,12,30]
[1,10]
[29,29]</pre>
Or, we could write '''sum . fmap digitToInt''', or the equivalent but more efficient fusion of it to a single fold: '''foldr ((+) . digitToInt) 0'''
<syntaxhighlight lang="haskell">import Data.Char (digitToInt, intToDigit, isHexDigit)
import Data.List (transpose)
import Numeric (readInt, showIntAtBase)
------------------ SUM OF INTEGER DIGITS -----------------
digitSum :: String -> Int
Line 1,305 ⟶ 2,643:
intDigitSum :: Int -> Int -> Int
intDigitSum base
digitSum
. flip (showIntAtBase base intToDigit) []
-------------------------- TESTS -------------------------
main :: IO ()
main =
mapM_ putStrLn $
unwords
<$> transpose
( ( fmap
=<< flip justifyRight ' '
show v, -- value
-- sum from digit string
show (digitSum s),
-- sum from base and value
show (intDigitSum b v)
]
)
<$> [ ("1", 10),
("1234", 10),
("fe", 16),
("f0e", 16)
]
)
)
)
where
justifyRight n c
readBase b s = n
where
[(n, _)] = readInt b isHexDigit digitToInt s</syntaxhighlight>
{{Out}}
<pre> Base Digits Value digit string -> sum integer value -> sum
Line 1,348 ⟶ 2,704:
some of the other solutions.
<
write(dsum(a[1]|1234,a[2]|10))
end
Line 1,357 ⟶ 2,713:
while sum +:= (0 < n) % b do n /:= b
return sum
end</
Sample runs:
Line 1,383 ⟶ 2,739:
=={{header|J}}==
<
Example use:
<
10
10 digsum 254
11
16 digsum 254
29</
Illustration of mechanics:
<
1234
10 #.inv 1234
Line 1,403 ⟶ 2,759:
10
10 +/@(#.inv) 1234
10</
So #.inv gives us the digits, +/ gives us the sum, and @ glues them together with +/ being a "post processor" for #.inv or, as we say in the expression: (#.inv). We need the parenthesis or inv will try to look up the inverse of +/@#. and that's not well defined.
Line 1,411 ⟶ 2,767:
Full examples:
<
1
digsum 1234
Line 1,418 ⟶ 2,774:
29
16 digsum 16bf0e
29</
Note that J implements numeric types -- J tries to ensure that the semantics of numbers match their mathematical properties. So it doesn't matter how we originally obtained a number.
<
254
254
Line 1,431 ⟶ 2,787:
254
254b10 , 1r254b0.1 NB. 10 in base 254 , 0.1 in base 1/254
254 254</
=={{header|Java}}==
<
public class SumDigits {
public static int sumDigits(long num) {
Line 1,465 ⟶ 2,821:
System.out.println(sumDigits(new BigInteger("12345678901234567890")));
}
}</
{{out}}
<pre>
Line 1,475 ⟶ 2,831:
90
</pre>
=={{header|JavaScript}}==
===Imperative===
<syntaxhighlight lang="javascript">function sumDigits(n) {
n += ''
for (var s=0, i=0, e=n.length; i<e; i+=1) s+=parseInt(n.charAt(i),36)
Line 1,485 ⟶ 2,841:
}
for (var n of [1, 12345, 0xfe, 'fe', 'f0e', '999ABCXYZ']) document.write(n, ' sum to ', sumDigits(n), '<br>')
</syntaxhighlight>
{{out}}
<pre>
Line 1,496 ⟶ 2,852:
</pre>
===Functional
====ES5====
<
'use strict';
Line 1,524 ⟶ 2,880:
.join('\n');
})();</syntaxhighlight>
<pre>1 -> 1
12345 -> 15
254 -> 11
fe -> 29
f0e -> 29
999ABCXYZ -> 162</pre>
====ES6====
<syntaxhighlight lang="javascript">(() => {
"use strict";
// -------------- INTEGER DIGITS SUMMED --------------
// digitsSummed :: (Int | String) -> Int
const digitsSummed = number => {
// 10 digits + 26 alphabetics
// give us glyphs for up to base 36
const intMaxBase = 36;
return `${number}`
.split("")
.reduce(
(sofar, digit) => sofar + parseInt(
digit, intMaxBase
),
0
);
};
// ---------------------- TEST -----------------------
return [1, 12345, 0xfe, "fe", "f0e", "999ABCXYZ"]
.map((x) => `${x} -> ${digitsSummed(x)}`)
.join("\n");
})();</syntaxhighlight>
{{Out}}
<pre>1 -> 1
12345 -> 15
Line 1,534 ⟶ 2,923:
f0e -> 29
999ABCXYZ -> 162</pre>
=={{header|Joy}}==
<syntaxhighlight lang="joy">DEFINE digitsum ==
[swap string] [dup [strtol] dip] [] ifte
[<] [pop] [dup rollup div rotate] [+] linrec.
1 10 digitsum.
1234 10 digitsum.
"fe" 16 digitsum.
"f0e" 16 digitsum.
</syntaxhighlight>
{{out}}
<pre>1
10
29
29</pre>
=={{header|jq}}==
The following pipeline will have the desired effect if numbers and/or strings are presented as input:
<
For example:<
$ jq -M 'tostring | explode | map(tonumber - 48) | add'
123
6
"123"
6</
=={{header|Julia}}==
Using the built-in <code>digits</code> function:
<
=={{header|Kotlin}}==
<
const val digits = "0123456789abcdefghijklmnopqrstuvwxyz"
Line 1,570 ⟶ 2,976:
println("The sum of digits is:")
for ((number, base) in numbers) println("$number\tbase $base\t-> ${sumDigits(number, base)}")
}</
{{out}}
Line 1,583 ⟶ 2,989:
16xyz base 36 -> 109
</pre>
=={{header|Lambdatalk}}==
Following Javascript, with 10 digits + 26 alphabetics giving us glyphs for up to base 36
<syntaxhighlight lang="scheme">
{def sum_digits
{lambda {:n}
{if {W.empty? {W.rest :n}}
then {parseInt {W.first :n} 36}
else {+ {parseInt {W.first :n} 36} {sum_digits {W.rest :n}}}}}}
-> sum_digits
{S.map {lambda {:i} {div}:i sum to {sum_digits :i}}
1 12345 0xfe fe f0e 999ABCXYZ}
->
1 sum to 1
12345 sum to 15
0xfe sum to 62
fe sum to 29
f0e sum to 29
999ABCXYZ sum to 162
</syntaxhighlight>
=={{header|Lasso}}==
<
define sumdigits(int, base = 10) => {
Line 1,609 ⟶ 3,037:
sumdigits(0xfe, 16)
br
sumdigits(0xf0e, 16)</
{{out}}
<pre>1
Line 1,618 ⟶ 3,046:
=={{header|Lingo}}==
<
sum = 0
repeat while n
Line 1,626 ⟶ 3,054:
end repeat
return sum
end</
<
-- 1
put sum_digits(1234, 10)
Line 1,635 ⟶ 3,063:
-- 29
put sum_digits(3854, 16) -- 0xf0e
-- 29</
=={{header|LiveCode}}==
<
local numb
if base is empty then put 10 into base
Line 1,645 ⟶ 3,073:
end repeat
return numb
end sumDigits</
Example
<
sumdigits(1234,10) & comma & \
sumdigits(fe,16) & comma & \
sumdigits(f0e,16)</
=={{header|Logo}}==
<
to digitvalue :digit
Line 1,663 ⟶ 3,091:
end
foreach [1 1234 fe f0e] [print (se ? "-> sumdigits ?)]</
{{Out}}
Line 1,672 ⟶ 3,100:
=={{header|Lua}}==
<
sum = 0
while n > 0.5 do
Line 1,686 ⟶ 3,114:
print(sum_digits(1234, 10))
print(sum_digits(0xfe, 16))
print(sum_digits(0xf0e, 16))</
{{out}}
<pre>1
Line 1,692 ⟶ 3,120:
29
29</pre>
=={{header|M2000 Interpreter}}==
<syntaxhighlight lang="m2000 interpreter">
module SumDigitisOfAnInteger {
z="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
sumdigits=lambda z (m as string) ->{
integer ret, i
m=ucase$(m)
if len(m)=0 then =ret:exit
for i=1 to len(m):ret+=instr(z, mid$(m,i,1))-1:next
=ret
}
CheckBase=lambda z (m as string, base as integer)->{
if len(m)=0 then Error "not valid input"
if base<2 or base>len(z) then Error "not valid input"
integer ret=1
m=ucase$(m)
for i=1 to len(m)
ret*=instr(z, mid$(m,i,1))<=base
if ret=0 then exit for
next
=ret<>0
}
string n
integer b
stack new {
data "1", 10
data "1234", 10
data ""+0xfe, 10
data "fe", 16
data "f0e", 16
while not empty
read n, b
Print n+" (base:"+b+") sums to "+sumdigits(n)
end while
}
Input "number, base :", n, b
if CheckBase(n, b) then
Print "sums to "+sumdigits(n)
else
Print n;" isn't a number of base "+b
end if
}
SumDigitisOfAnInteger
</syntaxhighlight>
{{out}}
<pre>
1 (base:10) sums to 1
1234 (base:10) sums to 10
254 (base:10) sums to 11
fe (base:16) sums to 29
f0e (base:16) sums to 29
number, base :12345671234567, 8
sums to 56
</pre>
=={{header|Maple}}==
<
local digits, number_to_string, i;
number_to_string := convert( num, string );
Line 1,701 ⟶ 3,187:
end proc:
sumDigits( 1234 );
sumDigits( "fe" );</
{{out}}
<pre>
Line 1,708 ⟶ 3,194:
</pre>
=={{header|Mathematica}}/{{header|Wolfram Language}}==
<
Total[IntegerDigits[16^^FE, 16]]</
{{out}}
<pre>10
29</pre>
=={{header|Miranda}}==
<syntaxhighlight lang="miranda">main :: [sys_message]
main = [Stdout (lay (map fmt tests))]
where tests = [(1,10), (1234,10), (0xfe,16), (0xf0e,16)]
fmt (d,b) = (shownum d) ++ "_" ++ (shownum b) ++ " -> " ++
(shownum (digitsum b d))
digitsum :: num->num->num
digitsum base 0 = 0
digitsum base n = n mod base + digitsum base (n div base)</syntaxhighlight>
{{out}}
<pre>1_10 -> 1
1234_10 -> 10
254_16 -> 29
3854_16 -> 29</pre>
=={{header|МК-61/52}}==
<syntaxhighlight lang="text">П0 <-> П1 Сx П2 ИП1 ^ ИП0 / [x]
П3 ИП0 * - ИП2 + П2 ИП3 П1 x=0
05 ИП2 С/П</
=={{header|ML}}==
Function with first argument valid base, second argument number
<syntaxhighlight lang="standard ml">
local
open IntInf
in
fun summDigits base = ( fn 0 => 0 | n => n mod base + summDigits base (n div base ) )
end;
summDigits 10 1 ;
summDigits 10 1234 ;
summDigits 16 0xfe ;
summDigits 16 0xf0e ;
summDigits 4332489243570890023480923 0x8092eeac80923984098234098efad2109ce341000c3f0912527130 ;
</syntaxhighlight>
output
<syntaxhighlight lang="standard ml">
val it = 1: IntInf.int
val it = 10: IntInf.int
val it = 29: IntInf.int
val it = 29: IntInf.int
val it = 4745468831557628080368936: IntInf.int
</syntaxhighlight>
==={{header|mLite}}===
Left in the to_radix even though not used in the solution.
<
fun to_radix (0, radix, result) = implode result
Line 1,764 ⟶ 3,289:
shosum ("1101010101010101010101010101010101010101010101010101010101010101010101010101010101010101",2);
shosum ("thequickbrownfoxjumpsoverthelazydog",36);
</syntaxhighlight>
Output
<pre>sum of digits of 10fg (base 17) = 32
Line 1,774 ⟶ 3,299:
{{trans|Pascal}}
{{works with|ADW Modula-2|any (Compile with the linker option ''Console Application'').}}
<
MODULE SumOFDigits;
FROM STextIO IMPORT
Line 1,824 ⟶ 3,349:
WriteLn;
END SumOFDigits.
</syntaxhighlight>
{{out}}
<pre>
Line 1,837 ⟶ 3,362:
===Strings===
Processes data as text from the command line. Provides a representative sample if no input is supplied:
<
options replace format comments java crossref symbols nobinary
Line 1,903 ⟶ 3,428:
return rVal
</syntaxhighlight>
{{out}}
<pre>
Line 1,925 ⟶ 3,450:
===Type <tt>int</tt>===
Processes sample data as <tt>int</tt> arrays:
<
options replace format comments java crossref symbols binary
Line 1,962 ⟶ 3,487:
iVal = Integer.valueOf(oVal, 8).intValue()
return iVal
</syntaxhighlight>
{{out}}
<pre>
Line 1,972 ⟶ 3,497:
Sum of digits for integer "10101100" for a given base of "2": 4
Sum of digits for integer "77" for a given base of "8": 14, 5
</pre>
=={{header|Never}}==
<syntaxhighlight lang="never">
func sum_digits(n : int, base : int) -> int {
var sum = 0;
do
{
sum = sum + n % base;
n = n / base
}
while (n != 0);
sum
}
func main() -> int {
print(sum_digits(1, 10));
print(sum_digits(12345, 10));
print(sum_digits(123045, 10));
print(sum_digits(0xfe, 16));
print(sum_digits(0Xf0e, 16));
0
}
</syntaxhighlight>
{{output}}
<pre>
1
15
15
29
29
</pre>
=={{header|Nim}}==
<
var n = n
while n > 0:
Line 1,985 ⟶ 3,544:
echo sumDigits(123045, 10)
echo sumDigits(0xfe, 16)
echo sumDigits(0xf0e, 16)</
{{out}}
<pre>1
Line 1,994 ⟶ 3,553:
=={{header|Oberon-2}}==
<
MODULE SumDigits;
IMPORT Out;
Line 2,014 ⟶ 3,573:
Out.String("OF0EH : ");Out.LongInt(Sum(0F0EH,16),10);Out.Ln
END SumDigits.
</syntaxhighlight>
{{out}}
<pre>
Line 2,021 ⟶ 3,580:
0FEH : 29
OF0EH : 29
</pre>
=={{header|Objeck}}==
<syntaxhighlight lang="objeck">class SumDigits {
function : Main(args : String[]) ~ Nil {
SumDigit(1)->PrintLine();
SumDigit(12345)->PrintLine();
SumDigit(0xfe, 16)->PrintLine();
SumDigit(0xf0e, 16)->PrintLine();
}
function : SumDigit(value : Int, base : Int := 10) ~ Int {
sum := 0;
do {
sum += value % base;
value /= base;
}
while(value <> 0);
return sum;
}
}
</syntaxhighlight>
{{output}}
<pre>
1
15
29
29
</pre>
=={{header|OCaml}}==
<
let rec aux sum x =
if x <= 0 then sum else
Line 2,038 ⟶ 3,626:
(sum_digits 123045 10)
(sum_digits 0xfe 16)
(sum_digits 0xf0e 16)</
{{out}}
Line 2,045 ⟶ 3,633:
=={{header|Oforth}}==
<
Usage :
<
sumDigits(1234, 10) println
sumDigits(0xfe, 16) println
sumDigits(0xf0e, 16) println</
{{out}}
Line 2,062 ⟶ 3,650:
=={{header|Ol}}==
<
(define (sum n base)
(if (zero? n)
Line 2,079 ⟶ 3,667:
(print (sum #xf0e 16))
; ==> 29
</syntaxhighlight>
=={{header|PARI/GP}}==
<
Also the built-in <code>sumdigits</code> can be used for base 10.
=={{header|Pascal}}==
<
function SumOfDigitBase(n:UInt64;base:LongWord): LongWord;
Line 2,113 ⟶ 3,701:
writeln('18446744073709551615 sums to ', SumOfDigitBase(High(Uint64),10));
end.</
;output:
<pre>
Line 2,121 ⟶ 3,709:
$FOE sums to 29
18446744073709551615 sums to 87</pre>
=={{header|Perl}}==
<
use strict;
use warnings;
Line 2,140 ⟶ 3,727:
print "$_ sums to " . sumdigits($_) . "\n"
for (qw/1 1234 1020304 fe f0e DEADBEEF/);</
{{out}}
<PRE>1 sums to 1
Line 2,149 ⟶ 3,736:
DEADBEEF sums to 104</PRE>
The ntheory module also does this, for a solution similar to
<
say sumdigits($_,36) for (qw/1 1234 1020304 fe f0e DEADBEEF/);</
=={{header|Phix}}==
{{libheader|Phix/basics}}
<!--<syntaxhighlight lang="phix">(phixonline)-->
<span style="color: #008080;">function</span> <span style="color: #000000;">sum_digits</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">base</span><span style="color: #0000FF;">)</span>
<span style="color: #004080;">integer</span> <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">0</span>
<span style="color: #008080;">while</span> <span style="color: #000000;">n</span> <span style="color: #008080;">do</span>
<span style="color: #000000;">res</span> <span style="color: #0000FF;">+=</span> <span style="color: #7060A8;">remainder</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">base</span><span style="color: #0000FF;">)</span>
<span style="color: #000000;">n</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">floor</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">/</span><span style="color: #000000;">base</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">while</span>
<span style="color: #008080;">return</span> <span style="color: #000000;">res</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">sum_digits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">sum_digits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1234</span><span style="color: #0000FF;">,</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">sum_digits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">#FE</span><span style="color: #0000FF;">,</span><span style="color: #000000;">16</span><span style="color: #0000FF;">)</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">sum_digits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">#F0E</span><span style="color: #0000FF;">,</span><span style="color: #000000;">16</span><span style="color: #0000FF;">)</span>
<!--</syntaxhighlight>-->
{{out}}
<pre>
Line 2,190 ⟶ 3,766:
=={{header|PHP}}==
<
function sumDigits($num, $base = 10) {
$s = base_convert($num, 10, $base);
Line 2,202 ⟶ 3,778:
echo sumDigits(0xfe, 16), "\n";
echo sumDigits(0xf0e, 16), "\n";
?></
{{out}}
<pre>
Line 2,211 ⟶ 3,787:
29
</pre>
=={{header|Picat}}==
<syntaxhighlight lang="picat">go =>
println(1=sum_digits(1)),
println(1234=sum_digits(1234)),
println('"1234"'=sum_digits("1234")),
println(1234=sum_digits(1234)),
println('"fe(16)"'=sum_digits("fe", 16)), % -> 29
println('"f0e(16)"'=sum_digits("f0e", 16)), % -> 29
println('"FOE(16)"'=sum_digits("F0E", 16)), % -> 29
println('123(16)'=sum_digits(123, 16)), % -> 6
println('"123"(16)'=sum_digits("123", 16)), % -> 6
println('"1110010101"(2)'=sum_digits("1110010101", 2)),
println('"picat"(36)'=sum_digits("picat", 36)),
Alpha = "0123456789abcdefghijklmnopqrstuvwxyz",
Rand = [Alpha[1+random2() mod Alpha.length] : _ in 1..40],
println(rand=Rand),
println(rand_sum_digits=sum_digits(Rand, 36)),
println("\nTesting exceptions"),
catch(println(sum_digits(Rand, 10)), E, println(exception=E)), % bad_base
catch(println(sum_digits("picat_is_fun!", 36)), E2, println(exeption=E2)), % bad_digit
catch(println(sum_digits("11100101", 1)),E3,println(exception=E3)), % bad base
catch(println(sum_digits("hi", 100)), E4, println(exception=E4)), % bad base
% Output base
println("\nOutput base"),
println('"fe(16,10)"'=sum_digits("fe", 16,10)), % -> 29
println('"fe(16,16)"'=sum_digits("fe", 16,16)), % -> 1d
println('"f0e(16,16)"'=sum_digits("f0e", 16,16)), % -> 1d
println('"1110010101"(2,2)'=sum_digits("1110010101", 2,2)), % -> 110
println('"rosetta(36,36)"'=sum_digits("rosetta", 36,36)), % 4h
nl.
% base 10
sum_digits(N) = sum([D.to_integer() : D in N.to_string()]), integer(N) => true.
sum_digits(N) = sum([D.to_integer() : D in N]), string(N) => true.
% base Base
sum_digits(N,Base) = sum_digits(N.to_string(), Base), integer(N) => true.
sum_digits(N,Base) = sum_digits(N,Base,10), string(N) => true.
sum_digits(N,Base,OutputBase) = Sum, string(N) =>
N := to_lowercase(N),
Alpha = "0123456789abcdefghijklmnopqrstuvwxyz",
Map = new_map([A=I : {A,I} in zip(Alpha,0..length(Alpha)-1)]),
M = [Map.get(I,-1) : I in N],
if max(M) >= Base ; Base < 2; Base > Alpha.length then
throw $bad_base('N'=N,base=Base)
elseif min(M) == -1 then
throw $bad_digits('N'=N,bad=[D : D in N, not Map.has_key(D) ])
else
if OutputBase != 10 then
Sum = dec_to_base(sum(M),OutputBase)
else
Sum = sum(M)
end
end.
dec_to_base(N, Base) = [Alpha[D+1] : D in reverse(Res)] =>
Alpha = "0123456789abcdefghijklmnopqrstuvwxyz",
Res = [],
while (N > 0)
R := N mod Base,
N := N div Base,
Res := Res ++ [R]
end.
base_to_dec(N, Base) = base_to_dec(N.to_string(), Base), integer(N) => true.
base_to_dec(N, Base) = Res =>
println($base_to_dec(N, Base)),
Alpha = "0123456789abcdefghijklmnopqrstuvwxyz",
Map = new_map([A=I : {A,I} in zip(Alpha,0..length(Alpha)-1)]),
Len = N.length,
Res = sum([Map.get(D)*Base**(Len-I) : {D,I} in zip(N,1..N.length)]).</syntaxhighlight>
{{out}}
<pre>1 = 1
1234 = 10
"1234" = 10
1234 = 10
"fe(16)" = 29
"f0e(16)" = 29
"FOE(16)" = 29
123(16) = 6
"123"(16) = 6
"1110010101"(2) = 6
"picat"(36) = 94
rand = ic5hprdfzrcs2h9hqko8dedirtk3fd6fs1sd7sxd
rand_sum_digits = 694
Testing exceptions
exception = bad_base(N = ic5hprdfzrcs2h9hqko8dedirtk3fd6fs1sd7sxd,base = 10)
exeption = bad_digits(N = picat_is_fun!,bad = __!)
exception = bad_base(N = 11100101,base = 1)
exception = bad_base(N = hi,base = 100)
Output base
"fe(16,10)" = 29
"fe(16,16)" = 1d
"f0e(16,16)" = 1d
"1110010101"(2,2) = 110
"rosetta(36,36)" = 4h</pre>
=={{header|PicoLisp}}==
<
(or
(=0 N)
(+ (% N Base) (sumDigits (/ N Base) Base)) ) )</
Test:
<
-> 1
Line 2,228 ⟶ 3,913:
: (sumDigits (hex "f0e") 16)
-> 29</
=={{header|PL/I}}==
<syntaxhighlight lang="pl/i">
sum_digits: procedure options (main); /* 4/9/2012 */
declare ch character (1);
Line 2,247 ⟶ 3,932:
end;
end sum_digits;
</syntaxhighlight>
results:
<pre>
Line 2,255 ⟶ 3,940:
SD= 5;
</pre>
=={{header|PL/M}}==
<syntaxhighlight lang="plm">100H:
BDOS: PROCEDURE (F,A); DECLARE F BYTE, A ADDRESS; GO TO 5; END BDOS;
EXIT: PROCEDURE; GO TO 0; END EXIT;
PRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;
PRINT$NUM: PROCEDURE (N);
DECLARE S (8) BYTE INITIAL ('.....',13,10,'$');
DECLARE (N, P) ADDRESS, C BASED P BYTE;
P = .S(5);
DIGIT:
P = P-1;
C = N MOD 10 + '0';
IF (N := N/10) > 0 THEN GO TO DIGIT;
CALL PRINT(P);
END PRINT$NUM;
DIGIT$SUM: PROCEDURE (N, BASE) BYTE;
DECLARE N ADDRESS, (BASE, SUM) BYTE;
SUM = 0;
DO WHILE N > 0;
SUM = SUM + N MOD BASE;
N = N / BASE;
END;
RETURN SUM;
END DIGIT$SUM;
CALL PRINT$NUM(DIGIT$SUM( 1, 10));
CALL PRINT$NUM(DIGIT$SUM( 1234, 10));
CALL PRINT$NUM(DIGIT$SUM( 0FEH, 16));
CALL PRINT$NUM(DIGIT$SUM(0F0EH, 16));
CALL EXIT;
EOF</syntaxhighlight>
{{out}}
<pre>1
10
29
29</pre>
=={{header|PowerShell}}==
<syntaxhighlight lang="powershell">
function Get-DigitalSum ([string] $number, $base = 10)
{
Line 2,272 ⟶ 3,996:
}
}
</syntaxhighlight>
{{out}}
Line 2,290 ⟶ 4,014:
==={{header|Alternative Implementation}}===
<syntaxhighlight lang="powershell">
function Get-DigitalSum ([string] $number, $base = 10)
{
Invoke-Expression (($number.ToCharArray() | ForEach-Object {[string][convert]::ToInt16($_, $base)}) -join "+")
}
</syntaxhighlight>
{{out}}
Line 2,312 ⟶ 4,036:
</pre>
=={{header|
{{works with|SWI Prolog}}
<syntaxhighlight lang="prolog">digit_sum(N, Base, Sum):-
digit_sum(N, Base, Sum, 0).
digit_sum(N, Base, Sum, S1):-
N < Base,
!,
Sum is S1 + N.
digit_sum(N, Base, Sum, S1):-
digit_sum(M, Base, Sum, S2).
test_digit_sum(N, Base):-
digit_sum(N, Base, Sum),
writef('Sum of digits of %w in base %w is %w.\n', [N, Base, Sum]).
main:-
test_digit_sum(0xf0e, 16).</syntaxhighlight>
{{out}}
<pre>
Sum of digits of 1 in base 10 is 1.
Sum of digits of 1234 in base 10 is 10.
</pre>
=={{header|Python}}==
<syntaxhighlight lang
from numpy import base_repr
def sumDigits(num, base=10):
return sum(int(x, base) for x in list(base_repr(num, base)))
</syntaxhighlight>
or
<syntaxhighlight lang="python">def sumDigits(num, base=10):
if base < 2:
print
return
while num >= base:
num, rem = divmod(num, base)
sum += rem
return sum + num
print
print
print
print
print
{{out}}
<pre>
Line 2,380 ⟶ 4,103:
</pre>
The following does no error checking and requires non-base 10 numbers passed as string arguments:
<syntaxhighlight lang="python">def sumDigits(num, base=10):
return sum(int(x, base) for x in str(num))
print
print
print
print
print
Each digit is base converted as it's summed.
Or, as a composition of re-usable abstractions:
<syntaxhighlight lang="python">'''Sum digits of an integer'''
from functools import reduce
# digitSum :: Int -> Int -> Int
def digitSum(base):
'''The sum of the digits of a
natural number in a given base.
'''
return lambda n: reduce(
lambda a, x: a + digitToInt(x),
showIntAtBase(base)(digitChar)(n)(''),
0
)
# --------------------------TEST---------------------------
# main :: IO ()
def main():
'''Digit sums of numbers in bases 10 and 16:'''
print(
fTable(main.__doc__)(
lambda nb: showIntAtBase(nb[0])(
digitChar
)(nb[1])(' in base ') + str(nb[0])
)(repr)(
uncurry(digitSum)
)([(10, 1), (10, 10), (16, 0xfe), (16, 0xf0e)])
)
# -------------------------DISPLAY-------------------------
# fTable :: String -> (a -> String) ->
# (b -> String) -> (a -> b) -> [a] -> String
def fTable(s):
'''Heading -> x display function -> fx display function ->
f -> xs -> tabular string.
'''
def go(xShow, fxShow, f, xs):
ys = [xShow(x) for x in xs]
w = max(map(len, ys))
return s + '\n' + '\n'.join(map(
lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),
xs, ys
))
return lambda xShow: lambda fxShow: lambda f: lambda xs: go(
xShow, fxShow, f, xs
)
# -------------------------GENERIC-------------------------
# digitChar :: Int to Char
def digitChar(n):
'''A digit char for integers drawn from [0..15]'''
return ' ' if 0 > n or 15 < n else '0123456789abcdef'[n]
# digitToInt :: Char -> Int
def digitToInt(c):
'''The integer value of any digit character
drawn from the 0-9, A-F or a-f ranges.
'''
oc = ord(c)
if 48 > oc or 102 < oc:
return None
else:
dec = oc - 48 # ord('0')
hexu = oc - 65 # ord('A')
hexl = oc - 97 # ord('a')
return dec if 9 >= dec else (
10 + hexu if 0 <= hexu <= 5 else (
10 + hexl if 0 <= hexl <= 5 else None
)
)
# showIntAtBase :: Int -> (Int -> String) -> Int -> String -> String
def showIntAtBase(base):
'''String representation of an integer in a given base,
using a supplied function for the string representation
of digits.
'''
def wrap(toChr, n, rs):
def go(nd, r):
n, d = nd
r_ = toChr(d) + r
return go(divmod(n, base), r_) if 0 != n else r_
return 'unsupported base' if 1 >= base else (
'negative number' if 0 > n else (
go(divmod(n, base), rs))
)
return lambda toChr: lambda n: lambda rs: (
wrap(toChr, n, rs)
)
# uncurry :: (a -> b -> c) -> ((a, b) -> c)
def uncurry(f):
'''A function over a tuple,
derived from a curried function.
'''
return lambda tpl: f(tpl[0])(tpl[1])
# MAIN ---
if __name__ == '__main__':
main()</syntaxhighlight>
{{Out}}
<pre>Digit sums of numbers in bases 10 and 16:
1 in base 10 -> 1
10 in base 10 -> 1
fe in base 16 -> 29
f0e in base 16 -> 29</pre>
=={{header|Quackery}}==
{{trans|Forth}}
<syntaxhighlight lang="quackery"> [ temp put 0
[ over while
swap temp share /mod
rot + again ]
nip temp release ] is digitsum ( n n --> n )
1 10 digitsum echo sp
1234 10 digitsum echo sp
hex FE 16 digitsum echo sp
hex F0E 16 digitsum echo</syntaxhighlight>
{{out}}
<pre>1 10 29 29</pre>
=={{header|R}}==
{{trans|Python}}
<
{
ret <- integer(as.integer(logb(x=n, base=base))+1L)
Line 2,419 ⟶ 4,280:
sum.digits(123045)
sum.digits(0xfe, 16)
sum.digits(0xf0e, 16)</
=={{header|Racket}}==
<
(define (sum-of-digits n base (sum 0))
(if (= n 0)
Line 2,445 ⟶ 4,304:
; (1234)_10 = 10
; (254)_16 = 29
; (3854)_16 = 29</
=={{header|Raku}}==
(formerly Perl 6)
This will handle input numbers in any base from 2 to 36.
The results are in base 10.
<syntaxhighlight lang="raku" line>say Σ $_ for <1 1234 1020304 fe f0e DEADBEEF>;
sub Σ { [+] $^n.comb.map: { :36($_) } }</syntaxhighlight>
{{out}}
<pre>1
10
10
29
29
104</pre>
=={{header|REXX}}==
===version 1===
<
/* REXX **************************************************************
* 04.12.2012 Walter Pachl
Line 2,472 ⟶ 4,346:
End
Say res '->' right(dsum,2)
Return</
{{out}}
<pre>
Line 2,490 ⟶ 4,364:
::* numbers may be expressed up to base 36
::* numbers may be any length (size)
<
parse arg z /*obtain optional argument from the CL.*/
if z='' | z="," then z= '1 1234 fe f0e +F0E -666.00 11111112222222333333344444449'
Line 2,500 ⟶ 4,374:
sumDigs: procedure; arg x; @=123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ; $=0
do k=1 to length(x); $=$ + pos( substr(x, k, 1), @); end /*k*/
return $</
'''output''' when using the default input:
<pre>
Line 2,516 ⟶ 4,390:
The function makes use of REXX's '''parse''' statement
<
parse arg z /*obtain optional argument from the CL.*/
if z='' | z="," then z=copies(7, 108) /*let's generate a pretty huge integer.*/
Line 2,528 ⟶ 4,402:
sumDigs: procedure; parse arg N 1 $ 2 ? /*use first decimal digit for the sum. */
do while ?\==''; parse var ? _ 2 ?; $=$+_; end /*while*/
return $</
'''output''' when using the default input:
<pre>
Line 2,535 ⟶ 4,409:
=={{header|Ring}}==
<
see "sum digits of 1 = " + sumDigits(1) + nl
see "sum digits of 1234 = " + sumDigits(1234) + nl
Line 2,548 ⟶ 4,422:
end
return sum
</syntaxhighlight>
=={{header|RPL}}==
RPL can natively handle numbers in bases 2,8,10 or 16, but displays them according to the current base mode. For example, when you type #256d, it will be immediately turned into #100h if HEX mode is active. As there is no way to force the base mode to the base used for input, switching to string handling looks like a reasonable approach for code clarity and size. A side effect is that it can proceed with numbers in any base between 2 and 36.
{{works with|Halcyon Calc|4.2.7}}
≪ →STR → digits
≪ 0
1 digits SIZE '''FOR''' j
digits j DUP SUB NUM
'''IF''' DUP 48 ≥ OVER 57 ≤ AND
'''THEN''' 48 -
'''ELSE''' IF DUP 65 ≥ OVER 90 ≤ AND
'''THEN''' 55 -
'''ELSE''' NOT
'''END END'''
+ '''NEXT'''
≫ ≫ '<span style="color:blue">∑DIGITS</span>' STO
1 <span style="color:blue">∑DIGITS</span>
1234 <span style="color:blue">∑DIGITS</span>
#FEh <span style="color:blue">∑DIGITS</span>
#F0Eh <span style="color:blue">∑DIGITS</span>
{{out}}
<pre>
4: 1
3: 10
2: 29
1: 29
</pre>
=={{header|Ruby}}==
<
</syntaxhighlight>
=={{header|Rust}}==
===Using an Iterator===
This solution creates an iterator which yields the digits of a given number using a given base and then utilizes the `sum` method which is implemented automatically on iterators.
<
impl Iterator for DigitIter {
Line 2,576 ⟶ 4,477:
fn main() {
println!("{}", DigitIter(1234,10).sum::<usize>());
}</
=={{header|Scala}}==
<
def sumDigits(x:String, base:Int):BigInt = x map(_.asDigit) sum</
Test:
<
sumDigits(0, 2) // => 0
sumDigits(0, 16) // => 0
Line 2,600 ⟶ 4,501:
sumDigits("000999ABCXYZ", 36) // => 162
sumDigits(BigInt("12345678901234567890")) // => 90
sumDigits("12345678901234567890", 10) // => 90</
=={{header|Scheme}}==
Line 2,608 ⟶ 4,509:
The output is the sum of the digits in the target base, displayed in base 10.
<
(import (scheme base)
(scheme write))
Line 2,649 ⟶ 4,550:
(test-case #b1101010101010101010101010101010101 2 10)
(test-case #b1101010101010101010101010101010101 2 1000)
</syntaxhighlight>
{{out}}
Line 2,668 ⟶ 4,569:
=={{header|Seed7}}==
<
const func integer: sumDigits (in var integer: num, in integer: base) is func
Line 2,689 ⟶ 4,590:
writeln(sumDigits(16#fe, 16));
writeln(sumDigits(16#f0e, 16));
end func;</
{{out}}
Line 2,703 ⟶ 4,604:
=={{header|Sidef}}==
{{trans|
<
str.chars.map{ Num(_, base) }.sum
}
Line 2,710 ⟶ 4,611:
<1 1234 1020304 fe f0e DEADBEEF>.each { |n|
say "Σ(#{n}) = #{Σ(n)}"
}</
{{out}}
<pre>
Line 2,720 ⟶ 4,621:
Σ(DEADBEEF) = 104
</pre>
=={{header|SQL}}==
{{works with|ORACLE 19c}}
This is not a particularly efficient solution, but it gets the job done.
<syntaxhighlight lang="sql">
/*
This code is an implementation of "Sum digits of an integer" in SQL ORACLE 19c
p_in_str -- input string
*/
with
function sum_digits(p_in_str in varchar2) return varchar2 is
v_in_str varchar(32767) := translate(p_in_str,'*-+','*');
v_sum integer;
begin
--
if regexp_count(v_in_str,'[0-9A-F]',1,'i')=length(v_in_str) then -- base 16
execute immediate 'select sum('||regexp_replace(v_in_str,'(\w)','to_number(''\1'',''X'')+')||'0) from dual' into v_sum;
--
elsif regexp_count(v_in_str,'[0-9]',1,'i')=length(v_in_str) then -- base 10
execute immediate 'select sum('||regexp_replace(v_in_str,'(\d)','\1+')||'0) from dual' into v_sum;
--
else
return 'Sum of digits for integer "'||p_in_str||'" not defined';
--
end if;
--
return 'Sum of digits for integer "'||p_in_str||'" = '||v_sum;
end;
--Test
select sum_digits('') as res from dual
union all
select sum_digits('000') as res from dual
union all
select sum_digits('-010') as res from dual
union all
select sum_digits('+010') as res from dual
union all
select sum_digits('120034') as res from dual
union all
select sum_digits('FE') as res from dual
union all
select sum_digits('f0e') as res from dual
union all
select sum_digits('öst12') as res from dual;
</syntaxhighlight>
{{out}}
<pre>
Sum of digits for integer "" not defined
Sum of digits for integer "000" = 0
Sum of digits for integer "-010" = 1
Sum of digits for integer "+010" = 1
Sum of digits for integer "120034" = 10
Sum of digits for integer "FE" = 29
Sum of digits for integer "f0e" = 29
Sum of digits for integer "öst12" not defined
</pre>
=={{header|Standard ML}}==
<syntaxhighlight lang="sml">fun sumDigits (0, _) = 0
| sumDigits (n, base) = n mod base + sumDigits (n div base, base)
val testInput = [(1, 10), (1234, 10), (0xfe, 16), (0xf0e, 16)]
val () = print (String.concatWith " " (map (Int.toString o sumDigits) testInput) ^ "\n")</syntaxhighlight>
=={{header|Stata}}==
<
a = ascii(strupper(s)):-48
return(sum(a:-(a:>9)*7))
Line 2,740 ⟶ 4,706:
sumdigits(inbase(16, 254, 10))
29</
=={{header|Swift}}==
{{works with|Swift|4.0}}
<syntaxhighlight lang="swift">
extension String: Error {
func sumDigits(withBase base: Int) throws -> Int {
Line 2,766 ⟶ 4,732:
print(try! "fe".sumDigits(withBase: 16))
print(try! "f0e".sumDigits(withBase: 16))
</syntaxhighlight>
{{out}}
<pre>
Line 2,777 ⟶ 4,743:
=={{header|Tcl}}==
Supporting arbitrary bases makes this primarily a string operation.
<
set total 0
foreach d [split $num ""] {
Line 2,791 ⟶ 4,757:
}
return $total
}</
Demonstrating:
<
puts [sumDigits 12345]
puts [sumDigits 123045]
puts [sumDigits fe 16]
puts [sumDigits f0e 16]
puts [sumDigits 000999ABCXYZ 36]</
{{out}}
<pre>
Line 2,807 ⟶ 4,773:
29
162
</pre>
=={{header|Transd}}==
<syntaxhighlight lang="scheme">#lang transd
MainModule : {
v10: [1, 1234, 10000000],
vvar: ["fe:16", "f0e:16", "2022:3", "Transd:30"],
sumDigits: (λ s String()
(with snum (substr s 0 ":")
base (first (substr s after: ":") "10") n 0
(textout "sum of " :left width: 10 (+ snum ":" base " : " ))
(tsd (split snum "") :reduce
using: (λ s String() (+= n (to-Int (+ s ":" base))))) (lout n))
),
_start: (lambda
(tsd v10 reduce: ["(to-String col1)"]
using: (λ s String() (sumDigits s)))
(tsd vvar reduce: ["(sumDigits col1)"] )
)
}</syntaxhighlight>{{out}}
<pre>
sum of 1:10 : 1
sum of 1234:10 : 10
sum of 10000000:10 : 1
sum of fe:16 : 29
sum of f0e:16 : 29
sum of 2022:3 : 6
sum of Transd:30 : 130
</pre>
== {{header|TypeScript}} ==
{{trans|Pascal}}
<syntaxhighlight lang="javascript">// Sum digits of an integer
function sumOfDigitBase(n: number, bas: number): number {
var digit = 0, sum = 0;
while (n > 0)
{
var tmp = Math.floor(n / bas);
digit = n - bas * tmp;
n = tmp;
sum += digit;
}
return sum;
}
console.log(` 1 sums to ${sumOfDigitBase(1, 10)}`);
console.log(` 1234 sums to ${sumOfDigitBase(1234, 10)}`);
console.log(` 0xfe sums to ${sumOfDigitBase(0xfe, 16)}`);
console.log(`0xf0e sums to ${sumOfDigitBase(0xf0e, 16)}`);
maxint = Number.MAX_SAFE_INTEGER;
console.log(`${maxint} (Number.MAX_SAFE_INTEGER) sums to ${sumOfDigitBase(maxint, 10)}`);
</syntaxhighlight>
{{out}}
<pre>
1 sums to 1
1234 sums to 10
0xfe sums to 29
0xf0e sums to 29
9007199254740991 (Number.MAX_SAFE_INTEGER) sums to 76
</pre>
=={{header|Ursa}}==
The function:
<
decl int ret
for (decl int i) (< i (size val)) (inc i)
Line 2,817 ⟶ 4,846:
end for
return ret
end sumDigits</
Calling the function: (This could be done on a single line, but it's split up for clarity.)
<
out (sumDigits "1234" 10) endl console
out (sumDigits "fe" 16) endl console
out (sumDigits "f0e" 16) endl console</
{{out}}
<pre>1
Line 2,830 ⟶ 4,859:
29</pre>
=={{header|
<syntaxhighlight lang="Uxntal">@sum-digits ( num* base* -: sum* )
#0000 STH2
&loop
OVR2 OVR2 DIV2k MUL2 SUB2
STH2r ADD2 STH2
DIV2k ORAk ?{ POP2 POP2 POP2 STH2r JMP2r }
SWP2 ROT2 POP2 !&loop</syntaxhighlight>
=={{header|V (Vlang)}}==
<syntaxhighlight lang="v (vlang)">
const digits = [[1, 10], [1234, 10], [0xfe, 16], [0xf0e, 16]]
fn main() {
for val in digits {println(sum_digits(val[0], val[1]))}
}
fn sum_digits(num int, base int) int {
mut sum, mut temp := 0, num
for temp > 0 {
sum += temp % base
temp /= base
}
return sum
}
</syntaxhighlight>
{{out}}
<pre>
29
29
</pre>
=={{header|Wren}}==
{{libheader|Wren-fmt}}
<syntaxhighlight lang="wren">import "./fmt" for Fmt, Conv
var sumDigits = Fn.new { |n, b|
var sum = 0
while (n > 0) {
sum = sum + n%b
n = (n/b).truncate
}
return sum
}
var tests = [ [1, 10], [1234, 10], [0xfe, 16], [0xf0e, 16], [1411, 8], [111, 3] ]
System.print("The sum of the digits is:")
for (test in tests) {
var n = test[0]
var b = test[1]
var sum = sumDigits.call(n, b)
Fmt.print("$-5s in base $2d = $2d", Conv.itoa(n, b), b, sum)
}</syntaxhighlight>
{{out}}
<pre>
The sum of the digits is:
1 in base 10 = 1
1234 in base 10 = 10
fe in base 16 = 29
f0e in base 16 = 29
2603 in base 8 = 11
11010 in base 3 = 3
</pre>
=={{header|XPL0}}==
<
func SumDigits(N, Base);
Line 2,888 ⟶ 4,945:
IntOut(0, SumDigits($FE, 16)); ChOut(0, ^ );
IntOut(0, SumDigits($F0E, 16)); CrLf(0);
]</
{{out}}
Line 2,896 ⟶ 4,953:
=={{header|zkl}}==
<
if(b==10) n.split().sum(0); // digits to list
else n.toString(b).split("").apply("toInt",b).sum(0);
}</
If not base 10, convert the int into a string (in the proper base, ie
0xfe-->"fe"), blow it apart into a list of digits/characters, convert
| |||