Code Golf December 2016

December 2016 - Oh xmas tree, oh xmas tree.md

December 2016 - Oh xmas tree, oh xmas tree

Task

Return an xmas tree n rows in length.

n will always be greater than 0.

Examples:

(1) => * 

(3) =>
  *
 ***
*****

(5) =>  
    *
   ***
  *****
 *******
*********

*^You can assume that you will always recieved valid input

About Code Golf Scotland

Language: Golang
Lenght: 149
Solution:

func p(h int){w:=1+2*(h-1);m:=(w+1)/2;for i:=0;i<h;i++{for y:=0;y<=w;y++{if y>=m-i&&y<=m+i{fmt.Printf("*");}else{fmt.Printf(" ")}};fmt.Printf("\n")}}

Language: Python 2.7
Length: 53
Solution:

def f(r):
 for i in range(r):
  print" "*(r-i)+"*"*(i+i+1)

Just realised that I need to return a value and not print it.

Language: Python 2.7
Length: 68
Solution:

def f(r):
  x=""
  for i in range(r):
    x+=" "*(r-i)+"*"*(i+i+1)+"\n"
  return x

Language: Haskell
Length: 65
A little late for Christmas, but still in December. :-)

t n=unlines$map(\h->replicate(n-h)' '++replicate(2*h-1)'*')[1..n]