Return to Answer

Commonmark migration

edited Jun 17, 2020 at 9:04

1

Haskell, 35 38 bytes

#Haskell, 35 38 bytes ListList comprehension thanks to nimi:

f x=unlines[[1..n]>>"*"|n<-[1..x]]

Old version:

f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

#Haskell, 35 38 bytes List comprehension thanks to nimi:

f x=unlines[[1..n]>>"*"|n<-[1..x]]

Old version:

f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

Haskell, 35 38 bytes

List comprehension thanks to nimi:

f x=unlines[[1..n]>>"*"|n<-[1..x]]

Old version:

f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

added 106 characters in body

edited Oct 10, 2016 at 16:01

838
6
6

#Haskell, 3835 38 bytes f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"List comprehension thanks to nimi:

f x=unlines[[1..n]>>"*"|n<-[1..x]]

Old version:

f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

#Haskell, 38 bytes f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

#Haskell, 35 38 bytes List comprehension thanks to nimi:

f x=unlines[[1..n]>>"*"|n<-[1..x]]

Old version:

f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

Got the byte count wrong again!

edited Oct 10, 2016 at 14:38

838
6
6

#Haskell, 3738 bytes f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

#Haskell, 37 bytes f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

#Haskell, 38 bytes f 0="" f n=f(n-1)++([1..n]>>"*")++"\n"

Alternate version:

g n=([1..n]>>"*")++"\n" f n=[1..n]>>=g

added 79 characters in body

edited Oct 10, 2016 at 14:24

838
6
6

Loading

deleted 1 character in body

edited Oct 10, 2016 at 14:13

838
6
6

Loading

answered Oct 10, 2016 at 13:59

838
6
6

Loading