TPK algorithm: Difference between revisions

Revision as of 06:40, 6 April 2006

Revision as of 09:32, 16 April 2006

Line 32:

map[$_+0,$_=<>],0..10

</pre>

==Python version==

The following Python version of the algorithm uses the common Python idiom of using a list instead of an array, (although their is an array module available):

from math import sqrt

def f(t):

return sqrt(abs(t))+5*t**3

a=list()

for i in range(11):

a.append(input())

for i in range(10,-1,-1):

y = f(a[i])

if y > 400:

print i, "TOO LARGE"

else:

print i,y

==References==