Programming Contest Template C++

// Author: Partho Sutra Dhor (pie)

#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define Partho      ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define del_nl      cin.ignore(numeric_limits<streamsize>::max(), '\n');

#define int         long long
#define double      long double
#define vi          vector<int>
#define vb          vector<bool>
#define vc          vector<char>
#define vs          vector<string>
#define vpii        vector<pair<int,int>>

#define mpii        map<int, int>
#define mpsi        map<string, int>
#define mpci        map<char, int>
#define mpss        map<string, string>

#define umpii       unordered_map<int, int>
#define umpsi       unordered_map<string, int>
#define umpci       unordered_map<char, int>
#define umpss       unordered_map<string, string>

#define nl          ("\n")
#define pb(n)       push_back(n)
#define ff          first
#define ss          second
#define sz(s)       (long long)(s.size())
#define all(v)      (v).begin(),(v).end()
#define in(x)       cin>>x;
#define inv(v)      for(auto &item : v) cin>>item;
#define inpair(v)   for(auto &item : v) cin>>item.ff>>item.ss;
#define fr(a,b,c)   for(int a=b;a<c;a++)
#define rfr(a,b,c)  for(int a=b;a>c;a--)
#define ifr(v)      for(auto item : v)

const double        PI = 3.1415926535;
const int           inf = 1e18;
const int           mod = 1000000007;

int modadd(int a, int b, int m) { a %= m; b %= m; return (a + b) % m; }
int modmul(int a, int b, int m) { a %= m; b %= m; return (a * b) % m; }
int modsub(int a, int b, int m) { a %= m; b %= m; return (a - b + m) % m; }
int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); }
int expo(int a, int n, int md) { int res = 1; while (n) { if (n & 1) { res = modmul(res, a, md); --n; } else { a = modmul(a, a, md); n >>= 1; } } return res; }
int expo(int a, int n) { int res = 1; while (n) { if (n & 1) { res *= a; --n; } else { a *= a; n >>= 1; } } return res; }
vb sieve(int n) { vb prime(n + 1, 1); prime[0] = prime[1] = 0; for (int i = 2; i * i <= n; i++) { if (prime[i]) { for (int j = i * i; j <= n; j += i) prime[j] = 0; } } return prime; }
bool is_prime(int n) { if (n < 2) return false; if (n == 2) return true; if (n % 2 == 0) return false; for (int i = 3; i * i <= n; i = i + 2) { if (n % i == 0) return false; }return true; }
int max(int a, int b) { return (a > b) ? a : b;}
int min(int a, int b) { return (a < b) ? a : b;}
int fibonacci(int n){double r1 = 1.618033988749895;double r2 = -0.6180339887498949;double r3 = 2.23606797749979;return (pow(r1, n) - pow(r2, n)) / r3;}
vi fibonacciArray(int n) {vi fibArray(n);if (n >= 1){fibArray[0] = 0;}if (n >= 2){fibArray[1] = 1;}for (int i = 2; i < n; ++i){fibArray[i] = fibArray[i - 1] + fibArray[i - 2];}return fibArray;}
/*---------------------------------------------------------------------------------------------------------------------------*/




void solve(int T)
{

    int n, i, j, k;
    in(n);
    cout << fibonacci(n) << endl;
}

signed main()
{
    Partho;
    int T = 1;
    cin >> T; // Comment this if you need only one test case.
    for (int i = 1; i <= T; i++) solve(i);
    return 0;
}