TPK algorithm: Difference between revisions

Revision as of 05:01, 16 May 2007

Revision as of 06:36, 3 June 2007

Line 47:

print i, y

</code>

==Ruby version==

The following Ruby version makes heavy use of blocks / closures, as is common practice in the language:

<code>

f = proc { |t| (t.abs + 5 * t ** 3) ** 0.5 }

(1..11).map { f[gets.to_i] }.each_with_index { |t,u| puts u, t > 400 ? "TOO LARGE" : t }

</code>

Or, in a slightly longer, but more standard implementation:

<code>

a = []

f = lambda { |t| (t.abs + 5 * t ** 3) ** 0.5 }

11.times { a << gets.to_i }.times do |i|

j = f[a.shift]

puts i, j > 400 ? "TOO LARGE" : j

end

</code>

==References==