Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit7a9c1c9

Browse files
author
Bartosz Kostka
authored
Merge pull request#1379 from cp-algorithms/remove-missing-links
Remove broken links#1137
2 parentsa3ae3e8 +3f9a3de commit7a9c1c9

File tree

4 files changed

+1
-5
lines changed

4 files changed

+1
-5
lines changed

‎src/combinatorics/binomial-coefficients.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -220,15 +220,13 @@ When $m$ is not square-free, a [generalization of Lucas's theorem for prime powe
220220
*[LightOj - Necklaces](http://www.lightoj.com/volume_showproblem.php?problem=1419)
221221
*[HACKEREARTH: Binomial Coefficient](https://www.hackerearth.com/problem/algorithm/binomial-coefficient-1/description/)
222222
*[SPOJ - Ada and Teams](http://www.spoj.com/problems/ADATEAMS/)
223-
*[DevSkill - Drive In Grid](https://devskill.com/CodingProblems/ViewProblem/61)
224223
*[SPOJ - Greedy Walking](http://www.spoj.com/problems/UCV2013E/)
225224
*[UVa 13214 - The Robot's Grid](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5137)
226225
*[SPOJ - Good Predictions](http://www.spoj.com/problems/GOODB/)
227226
*[SPOJ - Card Game](http://www.spoj.com/problems/HC12/)
228227
*[SPOJ - Topper Rama Rao](http://www.spoj.com/problems/HLP_RAMS/)
229228
*[UVa 13184 - Counting Edges and Graphs](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=5095)
230229
*[Codeforces - Anton and School 2](http://codeforces.com/contest/785/problem/D)
231-
*[DevSkill - Parandthesis](https://devskill.com/CodingProblems/ViewProblem/255)
232230
*[Codeforces - Bacterial Melee](http://codeforces.com/contest/760/problem/F)
233231
*[Codeforces - Points, Lines and Ready-made Titles](http://codeforces.com/contest/872/problem/E)
234232
*[SPOJ - The Ultimate Riddle](https://www.spoj.com/problems/DCEPC13D/)

‎src/combinatorics/inclusion-exclusion.md‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -449,7 +449,6 @@ A list of tasks that can be solved using the principle of inclusions-exclusions:
449449
*[TopCoder SRM 390 "SetOfPatterns"[difficulty: medium]](http://www.topcoder.com/stat?c=problem_statement&pm=8307)
450450
*[TopCoder SRM 176 "Deranged"[difficulty: medium]](http://community.topcoder.com/stat?c=problem_statement&pm=2013)
451451
*[TopCoder SRM 457 "TheHexagonsDivOne"[difficulty: medium]](http://community.topcoder.com/stat?c=problem_statement&pm=10702&rd=14144&rm=303184&cr=22697599)
452-
*[Test>>>thebest "HarmonicTriples" (in Russian)[difficulty: medium]](http://esci.ru/ttb/statement-62.htm)
453452
*[SPOJ#4191 MSKYCODE "Sky Code"[difficulty: medium]](http://www.spoj.com/problems/MSKYCODE/)
454453
*[SPOJ#4168 SQFREE "Square-free integers"[difficulty: medium]](http://www.spoj.com/problems/SQFREE/)
455454
*[CodeChef "Count Relations"[difficulty: medium]](http://www.codechef.com/JAN11/problems/COUNTREL/)

‎src/geometry/planar.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ In this article we will deal with finding both inner and outer faces of a planar
1313

1414
##Some facts about planar graphs
1515

16-
In this section we present several facts about planar graphs without proof. Readers who are interested in proofs should refer to[Graph Theory by R. Diestel](https://diestel-graph-theory.com/) (see[video lectures](https://www.youtube.com/@DiestelGraphTheory) based on this book) or some other book.
16+
In this section we present several facts about planar graphs without proof. Readers who are interested in proofs should refer to[Graph Theory by R. Diestel](https://www.math.uni-hamburg.de/home/diestel/books/graph.theory/preview/Ch4.pdf) (seealso[video lectures on planarity](https://www.youtube.com/@DiestelGraphTheory) based on this book) or some other book.
1717

1818
###Euler's theorem
1919
Euler's theorem states that any correct embedding of a connected planar graph with $n$ vertices, $m$ edges and $f$ faces satisfies:

‎src/graph/strongly-connected-components.md‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -152,7 +152,6 @@ Our condensation graph is now given by the vertices `components` (one strongly c
152152
* [SPOJ - Good Travels](http://www.spoj.com/problems/GOODA/)
153153
* [SPOJ - Lego](http://www.spoj.com/problems/LEGO/)
154154
* [Codechef - Chef and Round Run](https://www.codechef.com/AUG16/problems/CHEFRRUN)
155-
* [Dev Skills - A Song of Fire and Ice](https://devskill.com/CodingProblems/ViewProblem/79)
156155
* [UVA - 11838 - Come and Go](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2938)
157156
* [UVA 247 - Calling Circles](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=183)
158157
* [UVA 13057 - Prove Them All](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4955)

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp