MCPcopy Create free account

hub / github.com/EndlessCheng/codeforces-go / functions

Functions8,098 in github.com/EndlessCheng/codeforces-go

⨍ Functions 8,098◇ Types & classes 911
↓ 1 callersMethodbinarySearch
(o, s int)
main/1100-1199/1179C.go:39
↓ 1 callersMethodbinaryTree
随机二叉树 可用于生成随机表达式等 https://en.wikipedia.org/wiki/Random_binary_tree 参考：https://stackoverflow.com/questions/56873764/how-to-randomly-generate-a-binary-t
main/testutil/rand.go:229
↓ 1 callersMethodbuild
(o, l, r int)
main/1300-1399/1380F.go:39
↓ 1 callersMethodbuild
(s string, o, l, r int)
main/300-399/380C.go:24
↓ 1 callersMethodbuild
(a []int, o, l, r int)
main/700-799/718C.go:60
↓ 1 callersMethodbuild
(a []int, o, l, r int)
main/700-799/765F.go:16
↓ 1 callersMethodbuild
(o, l, r int)
main/1500-1599/1557D.go:13
↓ 1 callersMethodbuild
(o, l, r int)
main/1100-1199/1179C.go:12
↓ 1 callersMethodbuild
(o, l, r int)
main/1100-1199/1187D.go:20
↓ 1 callersMethodbuild
(o, l, r int)
main/400-499/474E.go:20
↓ 1 callersMethodbuild
(a []int, o, l, r int)
main/400-499/438D.go:27
↓ 1 callersMethodbuild
(a []int, o, l, r int)
main/1400-1499/1439C.go:22
↓ 1 callersMethodbuild
(o, l, r int)
main/1400-1499/1483C.go:15
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step3/a/main.go:31
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step3/c/main.go:22
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step3/b/main.go:18
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step1/c/main.go:12
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step1/b/main.go:23
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step2/a/main.go:26
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step2/d/main.go:20
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step2/f/main.go:20
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step2/e/main.go:24
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step2/c/main.go:17
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step2/b/main.go:22
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step4/a/main.go:20
↓ 1 callersMethodbuild
(a []int, o, l, r int)
main/edu/2/segmenttree2/step4/d/main.go:27
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step4/f/main.go:38
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step4/e/main.go:26
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step4/c/main.go:27
↓ 1 callersMethodbuild
(o, l, r int)
main/edu/2/segmenttree2/step4/b/main.go:20
↓ 1 callersMethodbuild
(a [][]int, o, l, r int)
main/1000-1099/1093G.go:36
↓ 1 callersMethodbuild
(a []int, o, l, r int)
main/1-99/52C.go:19
↓ 1 callersMethodbuild
(a []int, o, l, r int)
misc/luogu/p3373.go:18
↓ 1 callersMethodbuild
(o, l, r int)
misc/acwing/weekly/3/c/c.go:14
↓ 1 callersMethodbuild
(a []int, o, l, r int)
misc/acwing/weekly/12/c/c.go:17
↓ 1 callersMethodbuild
(o, l, r int)
misc/nowcoder/6741/c/c.go:18
↓ 1 callersMethodbuild
(a []int, o, l, r int)
misc/atcoder/abc185/f/f.go:22
↓ 1 callersMethodbuild
(o, l, r int)
misc/atcoder/dp/w/w.go:17
↓ 1 callersMethodbuild
(o, l, r int)
leetcode/biweekly/37/d/d.go:12
↓ 1 callersFunctionbuild84
(l, r int)
main/400-499/484E.go:51
↓ 1 callersFunctionbuildBST
(a []int)
copypasta/bst.go:63
↓ 1 callersFunctionbuildInterval
(rawInterval string)
leetcode/testutil/predefined_type_nowcoder.go:42
↓ 1 callersFunctionbuildKDT
另一种实现是选择的维度要满足其内部点的分布的差异度最大，见 https://oi-wiki.org/ds/kdt/
copypasta/kd_tree.go:112
↓ 1 callersFunctionbuildPoint
(rawPoint string)
leetcode/testutil/predefined_type_nowcoder.go:14
↓ 1 callersFunctionbuildSGT
(nodes []*sgtNode)
copypasta/scapegoat_tree.go:72
↓ 1 callersFunctioncanReach
(arr []int, start int)
leetcode/weekly/169/c/c.go:3
↓ 1 callersMethodceiling
(key int)
main/800-899/840D.go:173
↓ 1 callersFunctioncheck
(cnts [][26]int, bits int)
leetcode/weekly/160/c/c.go:10
↓ 1 callersMethodchr
(v byte)
copypasta/trie.go:46
↓ 1 callersFunctioncntFlip
(g [][]byte)
leetcode/season/2021fall/c/c.go:10
↓ 1 callersMethodcntLess
(key int)
leetcode/weekly/196/d/d.go:95
↓ 1 callersFunctioncombinations
(n, r int, do func(ids []int))
leetcode/biweekly/15/c/c.go:12
↓ 1 callersFunctioncompare
(x, y interface{})
leetcode/biweekly/67/d/d.go:24
↓ 1 callersFunctionconvolution58
(a, b []int)
main/900-999/958F3.go:64
↓ 1 callersFunctionconvolutionN58
(coefs [][]int)
main/900-999/958F3.go:89
↓ 1 callersFunctioncountShips
github.com/EndlessCheng/codeforces-go
leetcode/biweekly/14/d/d.go:24
↓ 1 callersMethodcreateDir
()
copypasta/template/leetcode/generator.go:470
↓ 1 callersMethoddel
(v int)
leetcode/weekly/250/d/d.go:28
↓ 1 callersMethoddelete
(key int)
main/500-599/527C_treap.go:109
↓ 1 callersMethoddelete
(l int)
main/500-599/558E.go:89
↓ 1 callersMethoddelete
(key int)
main/900-999/960F.go:85
↓ 1 callersMethoddelete
(l int)
main/900-999/915E.go:88
↓ 1 callersMethoddelete
(key int)
main/600-699/610D.go:94
↓ 1 callersMethoddelete
(s []byte, id int)
main/gym/101628K.go:122
↓ 1 callersMethoddelete
(key int)
leetcode/biweekly/36/d/d.go:80
↓ 1 callersMethoddelete
(key int)
leetcode/weekly/194/c/c.go:77
↓ 1 callersMethoddeleteMin
()
copypasta/red_black_tree.go:100
↓ 1 callersMethoddet
(b vec1299)
main/1200-1299/1299C.go:12
↓ 1 callersMethoddet
(b vec772)
main/700-799/772B.go:16
↓ 1 callersMethoddet
(b vec617)
main/600-699/617D.go:12
↓ 1 callersMethoddet
(b vec2586)
misc/luogu/p2586.go:36
↓ 1 callersMethoddfs
(o *TreeNode, v int)
leetcode/weekly/163/main.go:71
↓ 1 callersMethoddfs
(o *TreeNode, v int)
leetcode/weekly/163/b/b.go:23
↓ 1 callersFunctiondijkstra
(g [][]nb, st int)
leetcode/weekly/231/c/c.go:19
↓ 1 callersMethoddis
(b vecF)
misc/atcoder/abc168/c/c.go:20
↓ 1 callersMethoddis2
(b vecF)
main/1-99/1C.go:15
↓ 1 callersMethoddisToLine
(l line)
main/700-799/772B.go:22
↓ 1 callersMethoddisToSeg
(l line613)
main/600-699/613A.go:43
↓ 1 callersMethoddisToSeg
点到线段的距离
misc/luogu/p2586.go:40
↓ 1 callersFunctiondist
(p, q []int)
leetcode/weekly/206/c/c.go:125
↓ 1 callersFunctiondivideKDT
(a []*kdNode, k, dim int)
copypasta/kd_tree.go:86
↓ 1 callersMethoddo
(add int64)
copypasta/segment_tree.go:425
↓ 1 callersMethoddot
(b vec617)
main/600-699/617D.go:11
↓ 1 callersMethoddraw
(prefix string, isTail bool, str *string)
copypasta/red_black_tree.go:249
↓ 1 callersMethoddraw
* 逆时针旋转 90° 打印这棵树：根节点在最左侧，右子树在上侧，左子树在下侧 效果如下（只打印 key） Root │ ┌── 95 │ ┌── 94 │ ┌── 90 │ │ │ ┌── 89 │ │ │ ┌
copypasta/treap.go:208
↓ 1 callersMethoddraw
* 逆时针旋转 90° 打印这棵树：根节点在最左侧，右子树在上侧，左子树在下侧 效果如下（只打印 key） Root │ ┌── +∞ │ ┌── 96 │ ┌──
copypasta/splay.go:242
↓ 1 callersMethoddraw
* 逆时针旋转 90° 打印这棵树：根节点在最左侧，右子树在上侧，左子树在下侧 效果如下（只打印 key） Root │ ┌── 95 │ ┌── 94 │ ┌── 90 │ │ │ ┌── 89 │ │ │ ┌
copypasta/bst.go:386
↓ 1 callersFunctiondrawChart
(x, y []float64, showLine bool)
misc/imageutil/chart.go:31
↓ 1 callersMethodempty
()
main/500-599/590C.go:13
↓ 1 callersMethodempty
()
main/100-199/173B.go:12
↓ 1 callersMethodempty
()
main/1400-1499/1442C.go:12
↓ 1 callersMethodempty
()
main/800-899/821D.go:12
↓ 1 callersMethodempty
()
main/1000-1099/1063B.go:13
↓ 1 callersMethodempty
()
misc/atcoder/abc170/f/f.go:21
↓ 1 callersMethodempty
()
copypasta/trie.go:29
↓ 1 callersMethodendSecond
地图上所有点的信息素损失 1 单位，所有蚂蚁的年龄加 1
misc/luogu/p2586.go:239
↓ 1 callersFunctionequal
(a, b []int)
leetcode/weekly/234/b/b.go:28
↓ 1 callersFunctionequalMatrix
(a, b [][]int)
leetcode/weekly/244/a/a.go:28
↓ 1 callersFunctionescapeRegExp
(s)
misc/highlight.js:22
↓ 1 callersFunctionexgcd7C
(a, b int64)
main/1-99/7C.go:9
← previousnext →1,001–1,100 of 8,098, ranked by callers