tasks a-s
This commit is contained in:
parent
47bf37c096
commit
b83f433714
12433 changed files with 156208 additions and 123 deletions
|
|
@ -0,0 +1,28 @@
|
|||
pascal = (n) ->
|
||||
width = 6
|
||||
for r in [1..n]
|
||||
s = ws (width/2) * (n-r) # center row
|
||||
output = (n) -> s += pad width, n
|
||||
cell = 1
|
||||
output cell
|
||||
# Compute binomial coefficients as you go
|
||||
# across the row.
|
||||
for c in [1...r]
|
||||
cell *= (r-c) / c
|
||||
output cell
|
||||
console.log s
|
||||
|
||||
ws = (n) ->
|
||||
s = ''
|
||||
s += ' ' for i in [0...n]
|
||||
s
|
||||
|
||||
pad = (cnt, n) ->
|
||||
s = n.toString()
|
||||
# There is probably a better way to do this.
|
||||
cnt -= s.length
|
||||
right = Math.floor(cnt / 2)
|
||||
left = cnt - right
|
||||
ws(left) + s + ws(right)
|
||||
|
||||
pascal(7)
|
||||
Loading…
Add table
Add a link
Reference in a new issue