Educational Codeforces Round 87 (Rated for Div. 2) C1. Simple Polygon Embedding

• Time : O(1)
• Space : O(1)

#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

struct PairHash {
    inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};

#define M_PI 3.14159265358979323846  /* pi */
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }

using namespace std;


long double solve(ll n) {
    return 1/tan(M_PI  / (2*n));
}

int main() {
    ios_base::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(12);
    ll tc = 1;
    cin>>tc;
    for (ll i = 1; i <= tc; i++) {
        ll n;
        cin>>n;
        cout<<solve(n)<<endl;
    }
    return 0;
}