文件列表:

Makefile (366, 2022-03-07)
codeforces (0, 2022-03-07)
codeforces\377 (0, 2022-03-07)
codeforces\377\div2-f (0, 2022-03-07)
codeforces\377\div2-f\main.go (2939, 2022-03-07)
codejam-2020 (0, 2022-03-07)
codejam-2020\qualification (0, 2022-03-07)
codejam-2020\qualification\indicium (0, 2022-03-07)
codejam-2020\qualification\indicium\main.go (3498, 2022-03-07)
codejam-2020\qualification\nesting-depth (0, 2022-03-07)
codejam-2020\qualification\nesting-depth\main.go (979, 2022-03-07)
codejam-2020\qualification\parenting-partnering-returns (0, 2022-03-07)
codejam-2020\qualification\parenting-partnering-returns\main.go (1697, 2022-03-07)
codejam-2020\qualification\vestigium (0, 2022-03-07)
codejam-2020\qualification\vestigium\main.go (1299, 2022-03-07)
codejam-2020\round-1a (0, 2022-03-07)
codejam-2020\round-1a\pascal-walk (0, 2022-03-07)
codejam-2020\round-1a\pascal-walk\main.go (1325, 2022-03-07)
codejam-2020\round-1a\pattern-matching (0, 2022-03-07)
codejam-2020\round-1a\pattern-matching\main.go (1347, 2022-03-07)
interviews (0, 2022-03-07)
interviews\3sum (0, 2022-03-07)
interviews\3sum\main.go (1410, 2022-03-07)
interviews\basic-calculator (0, 2022-03-07)
interviews\basic-calculator\main.go (1996, 2022-03-07)
interviews\critical-connections-in-a-network (0, 2022-03-07)
interviews\critical-connections-in-a-network\main.go (2447, 2022-03-07)
interviews\delete-duplicate-folders (0, 2022-03-07)
interviews\delete-duplicate-folders\main.go (4762, 2022-03-07)
interviews\first-non-repeating-char (0, 2022-03-07)
interviews\first-non-repeating-char\main.go (1154, 2022-03-07)
interviews\largest-rectangle-in-histogram (0, 2022-03-07)
interviews\largest-rectangle-in-histogram\main.go (1385, 2022-03-07)
interviews\lfu-cache (0, 2022-03-07)
interviews\lfu-cache\main.go (2578, 2022-03-07)
interviews\maximum-genetic-difference-query (0, 2022-03-07)
interviews\maximum-genetic-difference-query\main.go (2724, 2022-03-07)
... ...

## The Inclusion-Exclusion Principle ##### Problems - [X] SPOJ: [EASYMATH](https://www.spoj.com/problems/EASYMATH/) - [X] SPOJ: [KPRIMESB](https://www.spoj.com/problems/KPRIMESB/) - [X] SPOJ: [NGM2](https://www.spoj.com/problems/NGM2/) - [X] SPOJ: [SQFREE](https://www.spoj.com/problems/SQFREE/) (Hint: Use Mobius function) - [ ] SPOJ: [SUBSET](https://www.spoj.com/problems/SUBSET/) - [ ] SPOJ: [IITKWPCH](https://www.spoj.com/problems/IITKWPCH/) - [ ] SPOJ: [MSKYCODE](https://www.spoj.com/problems/MSKYCODE/) ##### Resources - [CP-Algorithms - Inclusion Inclusion-Exclusion Principle](https://cp-algorithms.com/combinatorics/inclusion-exclusion.html) ## Divide and Conquer DP ##### Problems - [X] SPOJ: [LARMY](https://www.spoj.com/problems/LARMY/) - [ ] KATTIS: [money](https://open.kattis.com/problems/money) ##### Resources - [CP-Algorithms - Divide and Conquer DP](https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html) ## Connected components, bridges, articulations points ##### Definitions (that may not be accurate) - In a connected undirected graph, a **bridge** is an edge that if removed the graph becomes disconnected. - In a connected undirected graph, an **articulation point** or a **cut vertex** is a node that if removed the graph becomes disconnected. - A **strongly connected component** is a graph where every two nodes are reachable from each others. ##### Problems - [X] Leetcode: [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/) (Finding Bridges Offline) - [X] Codeforces: [Round 377 - Div2 F - Tourist Reform](https://codeforces.com/contest/732/problem/F) (Strong Orientation) ##### Resources - [CP-Algorithms - Finding Bridge Offline](https://cp-algorithms.com/graph/bridge-searching.html) - [CP-Algorithms - Strong Orientation](https://cp-algorithms.com/graph/strong-orientation.html)

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：