Pykeep
—
Back to courtyard
The Recursion Well · Spell · 4 min

sum_n 3

Recursive sum 1..n (0 if n=0).

Lv 1· 22/22· 3/1· 3
  • Define sum_n() so every test passes

n + sum(n-1)

1
2
3
4
5
6
7
8
The stone is quiet.