func_code_string: #include <bits/stdc++.h>   using namespace std;   #pragma warning(disable : 4996)   #pragma comment(linker,  /STACK:256000000 )   FILE *stream;   const int INF = 1e9 + 7;   const long long INFL = (long long)1e18 + 1;   const int SIZE = 2e5 + 10;   const int TSIZE = 1e3 + 10;   const long double eps = 0.000001;   const long long MOD = 1e9 + 7;   char POW(char a, char b) {     if (b == 0) return 1;     char cur = POW(a, b / 2);     if (b % 2 == 0)       return cur * cur;     else       return cur * cur * a;   }   long long gcd(long long &x, long long &y, long long a, long long b) {     if (a == 0) {       y = 1;       x = 0;       return abs(b);     }     long long x1 = 0, y1 = 0;     long long d = gcd(x1, y1, b % a, a);     x = y1 - (b / a) * x1;     y = x1;     return d;   }   long long gcd(long long a, long long b) {     if (a == 0) {       return abs(b);     }     long long d = gcd(b % a, a);     return d;   }   bool cmp(pair<int, int> a, pair<int, int> b) {     return (long long)a.first * b.second > (long long)a.second * b.first;   }   void accept() {     int n;     long double ans = INFL;     cin >> n;     vector<pair<long long, long long> > c(n + 2);     for (long long i = 0; i < n; i++) {       cin >> c[i].first >> c[i].second;       if (i < 2) {         c[n + i] = c[i];       }     }     for (int i = 1; i <= n + 1; i++) {       long long x = c[i].first, y = c[i].second;       long long xl = c[i - 1].first, yl = c[i - 1].second;       long long xr = c[i + 1].first, yr = c[i + 1].second;       long long a = yr - yl;       long long b = xl - xr;       long long z = xl * (yl - yr) + yl * (xr - xl);       long double cans = (a * x + b * y + z) / sqrt(a * a + b * b) / 2;       if (cans < 0) cans *= -1;       if (i == 1) ans = cans;       if (cans < ans) ans = abs(a * x + b * y + z) / sqrt(a * a + b * b) / 2;     }     cout << fixed << setprecision(10) << ans;   }   void solution() {     long long t = 1;     for (long long i = 0; i < t; i++) {       accept();     }     return;   }   void test() {     cout <<  100000 n ;     for (int k = 0; k < 100000 - 1; k++) {       cout << k + 1 <<    ;     }     cout <<  100000 n ;   }   int main() {     srand(time(0));     solution();     return 0;   }   