Roll for your task and post your solution.
Pro/g/ramming Challenges
Rolling
roll
roll
roll
roll time
ezpz
int fibonacci(int n)
{
if (n
roll
Done, rolling for another one
roll
Roll
Rolllll
Rll
(defun quine ()
(describe #'quine))
i will do it in forth
fine i am fucked
most of these challenges are not doable if you dont have something equivalent to 1 year of CS education.
Rolling
Rolling
Roll
Gay
Roll
roll
roll
>posting the old version
rolling anyways
roll
roll
roll
Roll,
needs codeforces tho
reroll
ROLL
ROLL
what's the new one?
ROLL
how about without using fib()?
def F():
a,b = 0,1
while True:
yield a
a, b = b, a + b
Roll
rolling
it was supposed to be a recursive call to fibonacci(n-i) but I fucked it up cause I can't code for shit without a compiler in front of me
roll
In days of old computing the sine and cosine in graphical applications was considered sacrilegious, and other workarounds were preferred. A lookup table woulda been the wiser choice. Today CPU cycles are much cheaper so this stands as an okay solution.
roll
What would you use instead?
i suck at programming, so rolling
rolling