Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/EndlessCheng/codeforces-go
/ functions
Functions
8,098 in github.com/EndlessCheng/codeforces-go
⨍
Functions
8,098
◇
Types & classes
911
Function
orthocenter
三角形垂心(三条高的交点) https://en.wikipedia.org/wiki/Altitude_(triangle)#Orthocenter 欧拉线上的四点中,九点圆圆心到垂心和外心的距离相等,而且重心到外心的距离是重心到垂心距离的一半。注意内心一般不在欧拉线上,除了等腰三角形外 http
copypasta/geometry.go:288
Function
p1077
github.com/EndlessCheng/codeforces-go
misc/luogu/p1077.go:10
Function
p1494
github.com/EndlessCheng/codeforces-go
misc/luogu/p1494.go:12
Function
p1792
(_r io.Reader, out io.Writer)
misc/luogu/p1792.go:20
Function
p1879
github.com/EndlessCheng/codeforces-go
misc/luogu/p1879.go:10
Function
p1948
github.com/EndlessCheng/codeforces-go
misc/luogu/p1948.go:11
Function
p2586
(_r io.Reader, _w io.Writer)
misc/luogu/p2586.go:268
Function
p2850
github.com/EndlessCheng/codeforces-go
misc/luogu/p2850.go:10
Function
p2868
github.com/EndlessCheng/codeforces-go
misc/luogu/p2868.go:11
Function
p2895
github.com/EndlessCheng/codeforces-go
misc/luogu/p2895.go:10
Function
p3373
(_r io.Reader, _w io.Writer)
misc/luogu/p3373.go:89
Function
p3527
github.com/EndlessCheng/codeforces-go
misc/luogu/p3527.go:10
Function
p4447
github.com/EndlessCheng/codeforces-go
misc/luogu/p4447.go:21
Function
p4878
github.com/EndlessCheng/codeforces-go
misc/luogu/p4878.go:10
Function
palindromePartition
(str string, k int)
leetcode/weekly/165/d/d.go:3
Method
parallel
(b vec)
copypasta/geometry.go:190
Function
parseBoolExpr
(s string)
leetcode/weekly/143/d/d.go:3
Function
parseExpression
表达式转表达式树 https://leetcode-cn.com/submissions/detail/186220993/
copypasta/misc.go:819
Method
parsePossibleSampleTexts
(texts []string, parseArgs bool)
copypasta/template/leetcode/generator.go:295
Function
partition
LC 86
leetcode/main.go:434
Method
path
DFS: 树上两点路径
copypasta/graph_tree.go:29
Function
pathInZigZagTree
github.com/EndlessCheng/codeforces-go
leetcode/weekly/143/b/b.go:6
Function
pathsWithMaxScore
github.com/EndlessCheng/codeforces-go
leetcode/biweekly/16/d/d.go:4
Function
peopleIndexes
(mat [][]string)
leetcode/weekly/189/c/c.go:5
Function
permPosLR
注:若输入的是一个 1~n 的排列,有更简单的写法(求两侧大于位置) 为简单起见,求出的下标从 1 开始(不存在时表示为 0 或 n+1) https://codeforces.com/contest/1156/problem/E
copypasta/monotone_stack.go:108
Function
permuteUnique
LC 47 给定一个可包含重复数字的序列,返回所有不重复的全排列
leetcode/main.go:282
Method
perpendicular
过点 a 的垂直于 l 的直线
copypasta/geometry.go:455
Function
placeWordInCrossword
github.com/EndlessCheng/codeforces-go
leetcode/weekly/260/c/c.go:4
Function
platesBetweenCandles
github.com/EndlessCheng/codeforces-go
leetcode/biweekly/64/c/c.go:4
Method
point
圆心角对应的点
copypasta/geometry.go:464
Method
point
(rad float64)
copypasta/geometry.go:467
Method
polarAngle
()
copypasta/geometry.go:1110
Function
polarAngleSort
极角排序 todo 给 1e5 个点,求包含原点的三角形个数 https://www.luogu.com.cn/problem/P2992 - 考虑补集 - 点和原点连直线,在直线一侧选两个点组成的三角形必然不会包含原点 - 双指针维护
copypasta/geometry.go:236
Function
polyConvFFTs
计算多个多项式的卷积 入参出参都是次项从低到高的系数 可重集大小为 k 的不同子集个数 https://codeforces.com/contest/958/problem/F3
copypasta/math_fft.go:112
Function
polyConvNTTs
计算多个多项式的卷积 入参出参都是次项从低到高的系数
copypasta/math_ntt.go:188
Method
pop
()
copypasta/heap.go:59
Method
pop
()
copypasta/heap.go:89
Method
pop
注:若要复用 top,需要将该节点的 lc 和 rc 置为 nil,fa 置为自身
copypasta/leftist_tree.go:73
Method
popPush
(v int)
copypasta/heap.go:40
Method
popPush
(v int64)
copypasta/heap.go:60
Function
possiblyEquals
github.com/EndlessCheng/codeforces-go
leetcode/weekly/265/d/d.go:6
Method
pow
多项式幂函数 https://blog.orzsiyuan.com/archives/Polynomial-Power/ https://oi-wiki.org/math/poly/ln-exp/#_5 模板题 https://www.luogu.com.cn/problem/P5245 模板题(a
copypasta/math_ntt.go:419
Method
powSum
(begin, end int, n int, mod int64)
copypasta/odt.go:93
Method
prepare
(l, r int)
copypasta/odt.go:44
Method
printAnswer
Check answer
copypasta/template/interactive_problem/main_test.go:41
Method
printAnswer
(a answer)
copypasta/template/interactive_problem/main.go:48
Function
printTable
打表就行了 2 1 1 1 1 3 1 2 1 2 3 2 1 1 2 4 1 3 1 3 4 2 2 1 3 4 3 1 1 3 5 1 4 1 4 5 2 3 1 4 5 3 2 1 4 5 4 1 1 4 6 1 5 2 5 6 2 4 2 5 6 3 3 2 5 6 4 2 2 5 6 5
main/1300-1399/1313B.go:91
Function
printVertically
(s string)
leetcode/weekly/172/b/b.go:5
Function
prisonAfterNDays
github.com/EndlessCheng/codeforces-go
leetcode/weekly/115/a/a.go:4
Function
probabilityOfHeads
github.com/EndlessCheng/codeforces-go
leetcode/biweekly/11/c/c.go:4
Function
processQueries
(qs []int, m int)
leetcode/weekly/184/b/b.go:3
Function
profitableSchemes
github.com/EndlessCheng/codeforces-go
leetcode/weekly/95/d/d.go:4
Method
pruferToTree
(n int, prufer []int)
copypasta/graph_tree.go:1417
Function
pseudoPalindromicPaths
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */
leetcode/weekly/190/c/c.go:13
Function
pseudoPalindromicPaths2
复杂度与 o.Val 的范围无关的写法
leetcode/weekly/190/c/c.go:42
Method
pseudotree
基环树(环套树),英文名叫 pseudotree,基环树森林叫 pseudoforest https://en.wikipedia.org/wiki/Pseudoforest 对于内向基环树,由于每个点的出度均为一,可以用 []int 来表示图 todo https://www.luogu.com.
copypasta/graph.go:2884
Method
push
(v int64)
copypasta/heap.go:58
Method
push
(v int64)
copypasta/heap.go:88
Method
pushPop
h 需要非空
copypasta/heap.go:61
Method
put
(key int)
main/gym/101628K.go:58
Method
put
持久化 注意为了拷贝一份 trie01Node,这里的接收器不是指针 roots := make([]*trie01Node, n+1) roots[0] = trie01Node{}.put(0, trieBitLen-1) roots[i+1] = roots[i].put(v, trieBit
copypasta/trie01.go:217
Method
put
(key, val int)
copypasta/scapegoat_tree.go:112
Method
put
(key rbKeyType, value rbValueType)
copypasta/red_black_tree.go:148
Method
put
持久化 注意为了拷贝一份 trieNode,这里的接收器不是指针 https://oi-wiki.org/ds/persistent-trie/ roots := make([]*trieNode, n+1) roots[0] = &trieNode{} roots[i+1] = roots[i]
copypasta/trie.go:286
Method
put
(key tpKeyType, val tpValueType)
copypasta/treap.go:126
Method
put
(key spKeyType, value spValueType)
copypasta/splay.go:157
Method
put
(p [2]int, val int)
copypasta/kd_tree.go:173
Method
query
(l, r int)
main/500-599/522B.go:55
Method
query
(o, l, r int)
main/300-399/380C.go:40
Method
query
(o, l, r int)
main/700-799/718C.go:102
Method
query
(o, l int)
main/700-799/765F.go:52
Method
query
(o, l, r int)
main/1500-1599/1557D.go:58
Method
query
(l, r int)
main/900-999/920F.go:73
Method
query
(l, r, v int)
main/900-999/914D.go:65
Method
query
(l, r, x int)
main/900-999/961E.go:66
Method
query
(l, r int)
main/1100-1199/1114F.go:105
Method
query
(o, l, r int)
main/1100-1199/1187D.go:41
Method
query
(l, r int)
main/400-499/484E.go:76
Method
query
(o, l, r int)
main/400-499/474E.go:44
Method
query
(o, l, r int)
main/400-499/438D.go:72
Method
query
(o, l int, v *int64)
main/1400-1499/1439C.go:68
Method
query
(o, l, r int)
main/1400-1499/1483C.go:39
Method
query
(l, r int)
main/800-899/891A.go:30
Method
query
(o, l, x int)
main/edu/2/segmenttree2/step3/c/main.go:62
Method
query
(o, k int)
main/edu/2/segmenttree2/step3/b/main.go:58
Method
query
(o, i int)
main/edu/2/segmenttree2/step1/c/main.go:50
Method
query
(o, i int)
main/edu/2/segmenttree2/step1/b/main.go:62
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step2/a/main.go:65
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step2/d/main.go:59
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step2/f/main.go:59
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step2/e/main.go:63
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step2/c/main.go:56
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step2/b/main.go:63
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step4/a/main.go:84
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step4/d/main.go:73
Method
query
(o, sumUpp int)
main/edu/2/segmenttree2/step4/f/main.go:84
Method
query
(o int, out io.Writer)
main/edu/2/segmenttree2/step4/e/main.go:74
Method
query
(o, l, r int)
main/edu/2/segmenttree2/step4/b/main.go:60
Method
query
(k int)
main/edu/2/segmenttree1/step3/b/main.go:39
Method
query
(l, r int)
main/edu/2/segmenttree1/step1/c/main.go:77
← previous
next →
7,701–7,800 of 8,098, ranked by callers