Fix bugs of empty lines in the example code

diff --git a/docs/geometry/inverse.md b/docs/geometry/inverse.md
index a4a2653..e26af75 100644 (file)
--- a/docs/geometry/inverse.md
+++ b/docs/geometry/inverse.md
@@ -85,12 +85,11 @@ author: hyp1231
     #include <iostream>
     #include <vector>
     using namespace std;
-    ```
-
+    
     const double EPS = 1e-8;         //精度系数
     const double PI = acos(-1.0);    //π
     const int N = 4;
-
+    
     struct Point {
         double x, y;
         Point(double x = 0, double y = 0) :x(x), y(y) {}
@@ -98,27 +97,27 @@ author: hyp1231
             return x == A.x ? y < A.y : x < A.x;
         }
     };  //点的定义
-
+    
     typedef Point Vector;   //向量的定义
-
+    
     Vector operator + (Vector A, Vector B) { return Vector(A.x + B.x, A.y + B.y); }    //向量加法
     Vector operator - (Vector A, Vector B) { return Vector(A.x - B.x, A.y - B.y); }    //向量减法
     Vector operator * (Vector A, double p) { return Vector(A.x*p, A.y*p); }        //向量数乘
     Vector operator / (Vector A, double p) { return Vector(A.x / p, A.y / p); }    //向量数除
-
+    
     int dcmp(double x) {
         if (fabs(x) < EPS)return 0; else return x < 0 ? -1 : 1;
     }   //与0的关系
-
+    
     double Dot(Vector A, Vector B) { return A.x * B.x + A.y * B.y; }    //向量点乘
     double Length(Vector A) { return sqrt(Dot(A, A)); }     //向量长度
     double Cross(Vector A, Vector B) { return A.x*B.y - A.y*B.x; }    //向量叉乘
-
+    
     Point GetLineProjection(Point P, Point A, Point B) {
         Vector v = B - A;
         return A + v*(Dot(v, P - A) / Dot(v, v));
     }   //点在直线上投影
-
+    
     struct Circle {
         Point c;
         double r;
@@ -126,7 +125,7 @@ author: hyp1231
         Circle(Point c, double r = 0) :c(c), r(r) {}
         Point point(double a) { return Point(c.x + cos(a)*r, c.y + sin(a)*r); }    //输入极角返回点坐标
     };  //圆
-
+    
     // a[i] 和 b[i] 分别是第i条切线在圆A和圆B上的切点
     int getTangents(Circle A, Circle B, Point* a, Point* b) {
         int cnt = 0;
@@ -135,7 +134,7 @@ author: hyp1231
         double rdiff = A.r - B.r;
         double rsum = A.r + B.r;
         if (dcmp(d2 - rdiff * rdiff) < 0) return 0;    //内含
-
+        
         double base = atan2(B.c.y - A.c.y, B.c.x - A.c.x);
         if (dcmp(d2) == 0 && dcmp(A.r - B.r) == 0)return -1;    //无限多条切线
         if (dcmp(d2 - rdiff*rdiff) == 0) {                //内切，一条切线
@@ -155,7 +154,7 @@ author: hyp1231
         }
         return cnt;
     }   // 两圆公切线 返回切线的条数，-1表示无穷多条切线
-
+    
     Circle Inversion_C2C(Point O, double R, Circle A) {
         double OA = Length(A.c - O);
         double RB = 0.5 * ((1 / (OA - A.r)) - (1 / (OA + A.r))) * R * R;
@@ -164,7 +163,7 @@ author: hyp1231
         double By = O.y + (A.c.y - O.y) * OB / OA;
         return Circle(Point(Bx, By), RB);
     }   // 点 O 在圆 A 外，求圆 A 的反演圆 B，R 是反演半径
-
+    
     Circle Inversion_L2C(Point O, double R, Point A, Vector v) {
         Point P = GetLineProjection(O, A, A + v);
         double d = Length(O - P);
@@ -172,11 +171,11 @@ author: hyp1231
         Vector VB = (P - O) / d * RB;
         return Circle(O + VB, RB);
     }   // 直线反演为过 O 点的圆 B，R 是反演半径
-
+    
     bool theSameSideOfLine(Point A, Point B, Point S, Vector v) {
         return dcmp(Cross(A - S, v)) * dcmp(Cross(B - S, v)) > 0;
     }   // 返回 true 如果 A B 两点在直线同侧
-
+    
     int main() {
         int T;
         scanf("%d", &T);
@@ -200,7 +199,7 @@ author: hyp1231
                 printf("%.8f %.8f %.8f\n", ansC[i].c.x, ansC[i].c.y, ansC[i].r);
             }
         }
-
+        
         return 0;
     }
     ```