HD-ACM算法专攻系列（9）——大菲波数

import java.math.BigInteger;
import java.util.*;

public class Main
{
		//主函数
        public static void main(String[] args)
        {
            int n, index;
			BigInteger f1, f2, fn;
			Scanner cin = new Scanner(System.in);
			n = cin.nextInt();
			for(int i = 0; i < n; i++)
			{
				index = cin.nextInt();
				f1 = BigInteger.valueOf(1);
				f2 = BigInteger.valueOf(1);
				fn = BigInteger.valueOf(2);
				
				if(index < 3)
				{
					System.out.println(1);
				}
				else
				{
					for(int j = 3; j <= index; j++)
					{
						fn = f2.add(f1);
						f1 = f2;
						f2 = fn;
						
					}
					System.out.println(fn);
				}
			
			}
		}
}