diff --git a/src/combinatorics/binomial-coefficients.md b/src/combinatorics/binomial-coefficients.md index a81c8bd0d..9f065c1a7 100644 --- a/src/combinatorics/binomial-coefficients.md +++ b/src/combinatorics/binomial-coefficients.md @@ -220,7 +220,6 @@ When $m$ is not square-free, a [generalization of Lucas's theorem for prime powe * [LightOj - Necklaces](http://www.lightoj.com/volume_showproblem.php?problem=1419) * [HACKEREARTH: Binomial Coefficient](https://www.hackerearth.com/problem/algorithm/binomial-coefficient-1/description/) * [SPOJ - Ada and Teams](http://www.spoj.com/problems/ADATEAMS/) -* [DevSkill - Drive In Grid](https://devskill.com/CodingProblems/ViewProblem/61) * [SPOJ - Greedy Walking](http://www.spoj.com/problems/UCV2013E/) * [UVa 13214 - The Robot's Grid](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5137) * [SPOJ - Good Predictions](http://www.spoj.com/problems/GOODB/) @@ -228,7 +227,6 @@ When $m$ is not square-free, a [generalization of Lucas's theorem for prime powe * [SPOJ - Topper Rama Rao](http://www.spoj.com/problems/HLP_RAMS/) * [UVa 13184 - Counting Edges and Graphs](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=5095) * [Codeforces - Anton and School 2](http://codeforces.com/contest/785/problem/D) -* [DevSkill - Parandthesis](https://devskill.com/CodingProblems/ViewProblem/255) * [Codeforces - Bacterial Melee](http://codeforces.com/contest/760/problem/F) * [Codeforces - Points, Lines and Ready-made Titles](http://codeforces.com/contest/872/problem/E) * [SPOJ - The Ultimate Riddle](https://www.spoj.com/problems/DCEPC13D/) diff --git a/src/combinatorics/inclusion-exclusion.md b/src/combinatorics/inclusion-exclusion.md index b89b22c4f..ed6767216 100644 --- a/src/combinatorics/inclusion-exclusion.md +++ b/src/combinatorics/inclusion-exclusion.md @@ -449,7 +449,6 @@ A list of tasks that can be solved using the principle of inclusions-exclusions: * [TopCoder SRM 390 "SetOfPatterns" [difficulty: medium]](http://www.topcoder.com/stat?c=problem_statement&pm=8307) * [TopCoder SRM 176 "Deranged" [difficulty: medium]](http://community.topcoder.com/stat?c=problem_statement&pm=2013) * [TopCoder SRM 457 "TheHexagonsDivOne" [difficulty: medium]](http://community.topcoder.com/stat?c=problem_statement&pm=10702&rd=14144&rm=303184&cr=22697599) -* [Test>>>thebest "HarmonicTriples" (in Russian) [difficulty: medium]](http://esci.ru/ttb/statement-62.htm) * [SPOJ #4191 MSKYCODE "Sky Code" [difficulty: medium]](http://www.spoj.com/problems/MSKYCODE/) * [SPOJ #4168 SQFREE "Square-free integers" [difficulty: medium]](http://www.spoj.com/problems/SQFREE/) * [CodeChef "Count Relations" [difficulty: medium]](http://www.codechef.com/JAN11/problems/COUNTREL/) diff --git a/src/geometry/nearest_points.md b/src/geometry/nearest_points.md index 4aab174d5..0c8abc259 100644 --- a/src/geometry/nearest_points.md +++ b/src/geometry/nearest_points.md @@ -173,6 +173,6 @@ In fact, to solve this problem, the algorithm remains the same: we divide the fi * [UVA 10245 "The Closest Pair Problem" [difficulty: low]](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1186) * [SPOJ #8725 CLOPPAIR "Closest Point Pair" [difficulty: low]](https://www.spoj.com/problems/CLOPPAIR/) * [CODEFORCES Team Olympiad Saratov - 2011 "Minimum amount" [difficulty: medium]](http://codeforces.com/contest/120/problem/J) -* [Google CodeJam 2009 Final " Min Perimeter "[difficulty: medium]](https://code.google.com/codejam/contest/311101/dashboard#s=a&a=1) +* [Google CodeJam 2009 Final "Min Perimeter" [difficulty: medium]](https://github.com/google/coding-competitions-archive/blob/main/codejam/2009/world_finals/min_perimeter/statement.pdf) * [SPOJ #7029 CLOSEST "Closest Triple" [difficulty: medium]](https://www.spoj.com/problems/CLOSEST/) * [TIMUS 1514 National Park [difficulty: medium]](https://acm.timus.ru/problem.aspx?space=1&num=1514) diff --git a/src/geometry/planar.md b/src/geometry/planar.md index 1c613f585..57c91ae2d 100644 --- a/src/geometry/planar.md +++ b/src/geometry/planar.md @@ -13,7 +13,7 @@ In this article we will deal with finding both inner and outer faces of a planar ## Some facts about planar graphs -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://sites.math.washington.edu/~billey/classes/562.winter.2018/articles/GraphTheory.pdf) or some other book. +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) (see also [video lectures on planarity](https://www.youtube.com/@DiestelGraphTheory) based on this book) or some other book. ### Euler's theorem Euler's theorem states that any correct embedding of a connected planar graph with $n$ vertices, $m$ edges and $f$ faces satisfies: diff --git a/src/graph/strongly-connected-components.md b/src/graph/strongly-connected-components.md index 9cf0006fa..5fd7a525b 100644 --- a/src/graph/strongly-connected-components.md +++ b/src/graph/strongly-connected-components.md @@ -152,7 +152,6 @@ Our condensation graph is now given by the vertices `components` (one strongly c * [SPOJ - Good Travels](http://www.spoj.com/problems/GOODA/) * [SPOJ - Lego](http://www.spoj.com/problems/LEGO/) * [Codechef - Chef and Round Run](https://www.codechef.com/AUG16/problems/CHEFRRUN) -* [Dev Skills - A Song of Fire and Ice](https://devskill.com/CodingProblems/ViewProblem/79) * [UVA - 11838 - Come and Go](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2938) * [UVA 247 - Calling Circles](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=183) * [UVA 13057 - Prove Them All](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4955) pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy