Return to Answer

Commonmark migration

edited Jun 17, 2020 at 9:04

#Haskell, 67 bytes

Haskell, 67 bytes

n('9':x)='0':n x n(c:x)=succ c:x n""="0" f x=reverse$iterate n""!!x

this solution basically adds 1 the given number of times, in shortlex notation.

usage:

>f 9 "8" >f 100 "89"

#Haskell, 67 bytes

n('9':x)='0':n x n(c:x)=succ c:x n""="0" f x=reverse$iterate n""!!x

this solution basically adds 1 the given number of times, in shortlex notation.

usage:

>f 9 "8" >f 100 "89"

n('9':x)='0':n x n(c:x)=succ c:x n""="0" f x=reverse$iterate n""!!x

this solution basically adds 1 the given number of times, in shortlex notation.

usage:

>f 9 "8" >f 100 "89"

answered Sep 9, 2014 at 13:55

#Haskell, 67 bytes

n('9':x)='0':n x n(c:x)=succ c:x n""="0" f x=reverse$iterate n""!!x

this solution basically adds 1 the given number of times, in shortlex notation.

usage:

>f 9 "8" >f 100 "89"