hdu1715 大菲波数

大菲波数

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10232    Accepted Submission(s): 3435

Problem Description

Fibonacci数列，定义如下：
f(1)=f(2)=1
f(n)=f(n-1)+f(n-2) n>=3。
计算第n项Fibonacci数值。

 

Input

输入第一行为一个整数N，接下来N行为整数Pi（1<=Pi<=1000）。

 

Output

输出为N行，每行为对应的f(Pi)。

 

Sample Input

   
   
   
   

    
    
    
    5
1
2
3
4
5
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    1
1
2
3
5
   
   
   
   

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.io.OutputStreamWriter;
import java.io.StreamTokenizer;
import java.io.IOException;
import java.math.BigInteger;

class Main
{
	public static final boolean DEBUG = false;
	public StreamTokenizer tokenizer;
	public PrintWriter cout;
	BufferedReader cin;
	BigInteger[] f;
	
	public void init() throws IOException
	{		
		if (DEBUG) {
			cin = new BufferedReader(new FileReader("d:\\OJ\\uva_in.txt"));
		} else {
			cin = new BufferedReader(new InputStreamReader(System.in));
		}
		tokenizer = new StreamTokenizer(cin);
		
		cout = new PrintWriter(new OutputStreamWriter(System.out));
		
		f = new BigInteger[1001];
		f[1] = f[2] = BigInteger.ONE;
		
		for (int i = 3; i < 1001; i++) {
			f[i] = f[i - 1].add(f[i - 2]);
		}
	}
	
	public int next() throws IOException
	{
		tokenizer.nextToken();
		
		if (tokenizer.ttype == StreamTokenizer.TT_NUMBER) return (int)tokenizer.nval;
		
		return -1;
	}
	
	public void solve(int n)
	{
		cout.print(f[n]);
		cout.println();
		cout.flush();
	}
	
	public static void main(String[] args) throws IOException
	{
		Main solver = new Main();
		solver.init();
		
		int t = solver.next();
		
		while (t-- > 0) {
			int n = solver.next();
			solver.solve(n);
		}
	}
}