OSDN Git Service

style: format markdown files with remark-lint
author24OI-bot <15963390+24OI-bot@users.noreply.github.com>
Thu, 18 Jul 2019 23:33:37 +0000 (19:33 -0400)
committer24OI-bot <15963390+24OI-bot@users.noreply.github.com>
Thu, 18 Jul 2019 23:33:37 +0000 (19:33 -0400)
docs/math/euler.md
docs/math/fermat.md

index fadd4ce..1829c70 100644 (file)
@@ -70,4 +70,4 @@ a^{b\bmod\varphi(p)+\varphi(p)},&\gcd(a,\,p)\ne1,\,b\ge\varphi(p)
 \pmod p
 $$
 
-证明和**习题**详见[欧拉定理](/math/fermat/)
+证明和 **习题** 详见[欧拉定理](/math/fermat/)
index 2be8252..9ddf437 100644 (file)
@@ -76,8 +76,8 @@ $$
 
 ## 习题
 
-1. [SPOJ #4141 "Euler Totient Function" [Difficulty: CakeWalk]](http://www.spoj.com/problems/ETF/)
-2. [UVA #10179 "Irreducible Basic Fractions" [Difficulty: Easy]](http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1120)
-3. [UVA #10299 "Relatives" [Difficulty: Easy]](http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1240)
-4. [UVA #11327 "Enumerating Rational Numbers" [Difficulty: Medium]](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2302)
-5. [TIMUS #1673 "Admission to Exam" [Difficulty: High]](http://acm.timus.ru/problem.aspx?space=1&num=1673)
+1.  [SPOJ #4141 "Euler Totient Function" \[Difficulty: CakeWalk\]](http://www.spoj.com/problems/ETF/)
+2.  [UVA #10179 "Irreducible Basic Fractions" \[Difficulty: Easy\]](http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1120)
+3.  [UVA #10299 "Relatives" \[Difficulty: Easy\]](http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1240)
+4.  [UVA #11327 "Enumerating Rational Numbers" \[Difficulty: Medium\]](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2302)
+5.  [TIMUS #1673 "Admission to Exam" \[Difficulty: High\]](http://acm.timus.ru/problem.aspx?space=1&num=1673)