Problem hidden

This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

SPOJ Problem Set (main)

5642. Fibonacci numbers

Problem code: FIBON

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:	2009-12-20
Time limit:	20s
Source limit:	50000B
Memory limit:	256MB
Cluster:	Pyramid (Intel Pentium III 733 MHz)
Languages:	All except: NODEJS
Resource:	Fibonacci numbers

hide comments

2012-07-20 00:46:49 Piotr Kąkol
I've rejudged all the submissions in the task. I'll do the same with the rest of my tasks as I receive a certain email.

2012-07-19 05:05:26 hallvabo
Piotr: is the leading 55 bytes Python 3 solution real? I find it hard to believe that Python 3 can match Python 2.x in this challenge...

2010-12-02 12:34:34 HWK
Thank you! But it doesn't help. Otherwise I've already found a solution.

2010-11-27 17:15:31 Piotr Kąkol
The error: "Method 'Bool' not found for invocant of class 'Integer'".

2010-11-27 16:26:11 HWK
Could you say me what's wrong with 4358310? On my Windows-machine 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?

2010-08-31 16:05:50 Piotr Kąkol
I cut some tests (but 70 is still the biggest).

Last edit: 2010-08-31 16:06:14

2010-08-31 14:58:19 Piotr Fusik
Still having to do silly things just to stay within time limit...

Last edit: 2010-08-31 14:58:50

2010-08-31 11: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. ;-)

2010-08-31 10:58:07 Piotr Fusik
Any chance of extending the time limit? Rakudo is damn slow.

2010-02-19 23: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. ;-)

Shortening codes