Cody

tkd

19591
Rank
2
Badges
100
Score
1 – 17 of 17

tkd received Commenter badge for Solution 2035340

on 26 Nov 2019

tkd submitted a Comment to Solution 2035340

I broke Cody server with this. function f = fib(n) a=[0 1]; indx=n-1; if n==0 f=a(1); elseif n==1 f=a(2); else while indx <= n a(indx+1)=fib(n-1)+fib(n-2); indx=indx+1; end f=a(n); end also my size is -1 shouldnt I win?

on 26 Nov 2019

tkd submitted Solution 2032536 to Problem 8. Add two numbers

on 23 Nov 2019

tkd received Solver badge for Solution 329060

on 4 Oct 2013

1 – 17 of 17