Submit  All submissions  Best solutions  Back to list 
FIBON  Fibonacci numbers 
Wersja polska  English version 
You are given number n and your task is to calculate nth Fibonacci number.
Input
The first line of the standard input contains one integer t (t<101) which is number of test cases.
In each of the next t lines there is one number n (n<71).
Output
For every test case print one number which is nth Fibonacci number.
Example
Input: 2
10
20
Output: 55
6765
Added by:  Piotr Kąkol 
Date:  20091220 
Time limit:  2.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: SCM qobi 
Resource:  Fibonacci numbers 
hide comments


20101127 15:26:11 HWK
Could you say me what's wrong with 4358310? On my Windowsmachine with Rakudo 2010.07 a testfile with numbers from "1" to "70" and 30 times "70" runs without problems. So why here is a NZEC? 

20100831 14:05:50 Piotr KÄ…kol
I cut some tests (but 70 is still the biggest). Last edit: 20100831 14:06:14 

20100831 12:58:19 Piotr Fusik
Still having to do silly things just to stay within time limit... Last edit: 20100831 12:58:50 

20100831 09:07:30 Piotr KÄ…kol
No problem, I did it even before reading Your comment when I saw that program in this task may execute more than 1.46 (in JS) which was the record till Your submission. ;) 

20100831 08:58:07 Piotr Fusik
Any chance of extending the time limit? Rakudo is damn slow. 

20100219 22:44:44 Piotr KÄ…kol
Use long long int and You will receive AC. :) And speak English in comments if You want to be understood by other contestants. ;) 

20100217 19:33:56 Hahas
nie rozumiem dlaczego mi wywala błędne odpowiedzi. Wszystko dobrze działa 