Language: C++

/*author: hyperion_1724
  date: 
*/

//Optional FAST

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")

//Required Libraries

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>

//Required namespaces

using namespace std;
using namespace __gnu_pbds;

//Required defines

#define endl '\n'

#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; for(long long i=0;i<N;i++) {cin>>A[i];}
#define rz(A,N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define trav(x,A) for(auto &x:A)
#define FORI(a,b,c) for(long long a=b;a<c;a++)
#define FORD(a,b,c) for(long long a=b;a>c;a--)

//Required typedefs

typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
typedef vector<int> veci;
typedef vector<long long> vecl;

//Required Constants

const long long inf=(long long)1e18;
const long long MOD=(long long)(1e9+7);
const long long INIT=(long long)(1e6+1);

//Required Functions

ll power(ll x,ll y) 
{ 
    if (y == 0) 
        return 1; 
    ll p = power(x, y/2) % MOD; 
    p = (p * p) % MOD; 
  
    return (y%2 == 0)? p : (x * p) % MOD; 
}
ll modInverse(ll a) 
{ 
   return power(a,MOD-2); 
   
}

//Work

pair<pair<long double,long double>,long double> findCircle(long double x1, long double y1, long double x2, long double y2, long double x3, long double y3) 
{ 
    long double x12 = x1 - x2; 
    long double x13 = x1 - x3; 
  
    long double y12 = y1 - y2; 
    long double y13 = y1 - y3; 
  
    long double y31 = y3 - y1; 
    long double y21 = y2 - y1; 
  
    long double x31 = x3 - x1; 
    long double x21 = x2 - x1; 
  
    // x1^2 - x3^2 
    long double sx13 = pow(x1, 2) - pow(x3, 2); 
  
    // y1^2 - y3^2 
    long double sy13 = pow(y1, 2) - pow(y3, 2); 
  
    long double sx21 = pow(x2, 2) - pow(x1, 2); 
    long double sy21 = pow(y2, 2) - pow(y1, 2); 
  
    long double f = ((sx13) * (x12) 
             + (sy13) * (x12) 
             + (sx21) * (x13) 
             + (sy21) * (x13)) 
            / (2 * ((y31) * (x12) - (y21) * (x13))); 
    long double g = ((sx13) * (y12) 
             + (sy13) * (y12) 
             + (sx21) * (y13) 
             + (sy21) * (y13)) 
            / (2 * ((x31) * (y12) - (x21) * (y13))); 
  
    long double c = -pow(x1, 2) - pow(y1, 2) - 2 * g * x1 - 2 * f * y1; 
    long double h = -g; 
    long double k = -f; 
    long double sqr_of_r = h * h + k * k - c; 
    long double r = sqrt(sqr_of_r); 
    return {{h,k},r};
    cout << "Centre = (" << h << ", " << k << ")" << endl; 
    cout << "Radius = " << r; 
} 

int main()
{
   
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    clock_t clk;
    clk = clock();
//-----------------------------------------------------------------------------------------------------------//

cout<<fixed<<setprecision(7);
    READV(N);
    pair<long double,long double> points[N];
    FORI(i,0,N)
    {
        READ(points[i].fi);
        READ(points[i].se);
    }
    if (N>=3)
    {
        ld ans=inf;
        ld ans1=0;
        FORI(i,0,N)
        {
            FORI(j,i+1,N)
            {
                ld z=sqrt((points[i].fi-points[j].fi)*(points[i].fi-points[j].fi)+(points[i].se-points[j].se)*(points[i].se-points[j].se))/2;
                ans1=max(ans1,z);   
                FORI(k,j+1,N)
                {
                    pair<pair<long double,long double>,long double> C=findCircle(points[i].fi, points[i].se, points[j].fi, points[j].se, points[k].fi, points[k].se);
                    bool ok=true;
                    FORI(l,0,N)
                    {
                        ld test=(points[l].fi-C.fi.fi)*(points[l].fi-C.fi.fi) + (points[l].se-C.fi.se)*(points[l].se-C.fi.se)-(C.se)*(C.se);
                        if (test>0.00000001)
                        {
                            ok=false;
                            break;
                        }
                    }
                    if (ok)
                    {
                        ans=min(ans,C.se);
                    }
                }
            }
        }
        cout<<ans1<<endl
    }
    else
    {
        ld ans=sqrt((points[0].fi-points[1].fi)*(points[0].fi-points[1].fi)+(points[0].se-points[1].se)*(points[0].se-points[1].se))/2;
        cout<<ans<<endl;
    }
    
    

//-----------------------------------------------------------------------------------------------------------//


    
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:170:5: error: expected ';' before '}' token
  170 |     }
      |     ^