C :

#include<stdio.h>
int main()
{
	int n,m;
	long long a[91]={0,1,1};
	scanf("%d",&n);
	for(int i=3;i<=90;i++)
	{
		a[i]=a[i-1]+a[i-2];
	}
	while(n--)
	{
		scanf("%d",&m);
		printf("%lld\n",a[m]);
	}
	return 0;
} 

C++ :

#include<iostream>
using namespace std;
int main()
{
	long long fib[90]={1,1};
	int n,a,i;
	for(i=2;i<90;i++)
	{
		fib[i]=fib[i-1]+fib[i-2];
	}
	cin>>n;
	while(n--)
	{
		cin>>a;
		cout<<fib[a-1]<<endl;
	}
	return 0;
}

Pascal :

var a:array[0..200]of qword;
i,n,x:longint;
begin
a[1]:=1;a[2]:=1;
for i:=3 to 91 do a[i]:=a[i-1]+a[i-2];
read(n);
for i:=1 to n do begin read(x);
writeln(a[x]);end
end.

Java :

import java.util.Scanner;
public class Main {
	 public static void main(String[] args) {
			Scanner sc=new Scanner(System.in);
			int n=sc.nextInt();
			while(n-->0){
				int m=sc.nextInt();
				if(1==m||2==m){
					System.out.println(1);
				}else{
					long f1=1,f2=1;
					long f3=0;
					for(int i=3;i<=m;i++){
						f3=f1+f2;
						f1=f2;
						f2=f3;
					}
					System.out.println(f3);
				}
			}
	}
}