C :

#include<stdio.h>

int main()
{
    int t,i,n,a[20];
    a[0]=1;
    a[1]=2;
    for(i=2;i<19;i++)
    	a[i]=a[i-1]+a[i-2];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("%d\n",a[n-1]);
    }
    return 0;
}

C++ :

#include<stdio.h>

int main()
{
    int t,i,n,a[20];
    a[0]=1;
    a[1]=2;
    for(i=2;i<19;i++)
    	a[i]=a[i-1]+a[i-2];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("%d\n",a[n-1]);
    }
    return 0;
}

Java :

import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
import java.math.*;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		String[] zong = in.nextLine().split(" ");
		int start = Integer.parseInt(zong[0]);
		 for(int i=0;i<start;i++){
		 String[] zong1 = in.nextLine().split(" ");
		int c=Integer.parseInt(zong1[0]);
		System.out.println(jc(c));
		 }

	}

	public static int jc(int i) {
		int k = 0;
		if (i == 0) // 0的阶乘=1
			return 1;
		else if (i > 0) {// 0继续递归
			k = jc(i - 2) + jc(i - 1);
		}
		return k;
	}
}