|
|
|
Author:
Posted: 25 Oct 2006 |
Perl golf challenge, open to the public.
Perl Golf rules
Deadline: 17:00 Fri 07 Oct 2006
TTA Perl Golf 2:
Print out prime Fibonacci numbers between 0 and N, inclusive, where N is received on stdin. Feel free to test proof-of-concept with a value of something like 100 or 1000 for N, but it should theoretically be any positive value.
For ease of reading, delimit output with a linebreak.
Click the "Post Comment" link below to post your solution. Use [color] tags inside [quote] tags to spoilertext the solution. Example:
[quote][color=white]code[/color][/quote]
PLAY GOLF
|
