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
↓ 2 callersMethod_spread
(o int)
main/200-299/242E.go:33
↓ 2 callersMethod_spread
(o int)
leetcode/season/2019fall/e/e.go:27
↓ 2 callersFunction_toLower
(c byte)
copypasta/template/leetcode/helper.go:43
↓ 2 callersFunctionabs
(x int)
misc/acwing/weekly/5/c/c.go:96
↓ 2 callersFunctionabs
(x int)
misc/acwing/weekly/24/b/b.go:28
↓ 2 callersFunctionabs
(x int)
misc/nowcoder/10325/a/a.go:24
↓ 2 callersFunctionabs
(x int)
leetcode/biweekly/16/b/b.go:26
↓ 2 callersFunctionabs
(x int)
leetcode/biweekly/1/c/c.go:84
↓ 2 callersFunctionabs
(x int)
leetcode/biweekly/47/a/a.go:17
↓ 2 callersFunctionabs
(x int)
leetcode/biweekly/9/b/b.go:14
↓ 2 callersFunctionabs
(x int)
leetcode/weekly/230/b/b.go:31
↓ 2 callersFunctionabs
(x int)
leetcode/weekly/235/c/c.go:28
↓ 2 callersFunctionabs
(x int)
leetcode/weekly/255/c/c.go:41
↓ 2 callersMethodadd
(b vec613)
main/600-699/613A.go:16
↓ 2 callersMethodadd
(from, to int)
main/600-699/623A.go:16
↓ 2 callersMethodbalance
()
copypasta/red_black_tree.go:79
↓ 2 callersFunctionbin
(v int)
leetcode/weekly/221/d/d.go:11
↓ 2 callersFunctionbuildListNode
(rawArray string)
leetcode/testutil/predefined_type.go:220
↓ 2 callersFunctionbuildTreeNode
https://support.leetcode.com/hc/en-us/articles/360011883654-What-does-1-null-2-3-mean-in-binary-tree-representation
leetcode/testutil/predefined_type.go:16
↓ 2 callersMethodcalc
(a, b data, ln int)
main/edu/2/segmenttree2/step4/d/main.go:18
↓ 2 callersFunctioncalcFibonacci
(p, q, a0, a1, n int)
misc/nowcoder/9247/a/a.go:49
↓ 2 callersFunctioncanMerge
(trees []*TreeNode)
leetcode/weekly/249/d/d.go:8
↓ 2 callersMethodcanReach
格点 p 是否可达
misc/luogu/p2586.go:122
↓ 2 callersFunctioncheck
(a, b string)
leetcode/weekly/210/c/c.go:13
↓ 2 callersFunctioncircumcenter
三角形外心（外接圆圆心，三条边的垂直平分线的交点） 另一种写法是求两中垂线交点 https://en.wikipedia.org/wiki/Circumscribed_circle https://codeforces.com/problemset/problem/1/C
copypasta/geometry.go:261
↓ 2 callersMethodcmp
(b int)
main/1300-1399/1398E.go:19
↓ 2 callersMethodcmp
(b int)
main/1200-1299/1249D2.go:17
↓ 2 callersMethodcmp
(b int)
copypasta/scapegoat_tree.go:30
↓ 2 callersMethodcmp
设置如下返回值是为了方便使用 tpNode 中的 lr 数组
copypasta/treap.go:40
↓ 2 callersMethodcmp
(b entry)
leetcode/biweekly/55/d/d.go:81
↓ 2 callersMethodcmp
(b int)
leetcode/weekly/230/d/d.go:13
↓ 2 callersMethodcmp
(b int)
leetcode/weekly/236/d/d.go:14
↓ 2 callersMethodcmpKth
设置如下返回值是为了方便使用 spNode 中的 lr 数组
copypasta/splay.go:32
↓ 2 callersFunctioncopyFile
(dst, src string)
copypasta/template/helper.go:12
↓ 2 callersMethodcountLimitXOR
(v, limit int)
leetcode/weekly/233/d/d.go:85
↓ 2 callersFunctioncountPairs
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */
leetcode/weekly/199/c/c.go:13
↓ 2 callersMethodcountRoots
(st int)
leetcode/weekly/205/d/d.go:29
↓ 2 callersMethodcross
(b vec552)
main/500-599/552D.go:15
↓ 2 callersMethodcut
将 o 变成树的根节点，若 o 和 p 之间存在边，则删除该边
copypasta/link_cut_tree.go:171
↓ 2 callersMethoddelete
(key int)
main/1300-1399/1398E.go:110
↓ 2 callersMethoddelete
(key int)
main/1200-1299/1249D2.go:91
↓ 2 callersMethoddelete
(key int)
main/1500-1599/1528C.go:85
↓ 2 callersMethoddelete
(key, val int)
main/800-899/840D.go:171
↓ 2 callersMethoddelete
(key tpKeyType)
copypasta/treap.go:160
↓ 2 callersMethoddelete
(key entry)
leetcode/biweekly/55/d/d.go:145
↓ 2 callersMethoddet
(b vec36)
main/1000-1099/1036E.go:14
↓ 2 callersMethoddet
(b vecF)
main/1-99/1C.go:13
↓ 2 callersMethoddet
(b vec)
leetcode/season/2020spring2/e/e.go:10
↓ 2 callersFunctiondfs1214D
(cell [][]byte, i, j int)
main/1200-1299/1214D.go:9
↓ 2 callersMethoddft
(a []complex128)
main/900-999/958F3.go:53
↓ 2 callersMethoddft
(a []complex128)
copypasta/math_fft.go:69
↓ 2 callersFunctiondijkstra
(g [][]edge, start int)
leetcode/weekly/266/d/d.go:63
↓ 2 callersMethoddis2
(b vec)
misc/nowcoder/10325/c/c.go:14
↓ 2 callersMethoddiv
(k float64)
copypasta/geometry.go:193
↓ 2 callersMethoddiv
多项式除法 https://blog.orzsiyuan.com/archives/Polynomial-Division-and-Modulo/ https://oi-wiki.org/math/poly/div-mod/ 模板题 https://www.luogu.com.cn/problem/
copypasta/math_ntt.go:320
↓ 2 callersMethoddo
(l, r data80)
main/300-399/380C.go:16
↓ 2 callersMethoddo
(a, b int)
misc/atcoder/abc185/f/f.go:15
↓ 2 callersFunctiondo559B
(s string)
main/500-599/559B.go:9
↓ 2 callersMethoddoFlip
()
copypasta/link_cut_tree.go:56
↓ 2 callersFunctiondoInteraction
(it interaction)
copypasta/template/interactive_problem/main.go:64
↓ 2 callersMethoddot
(b vec613)
main/600-699/613A.go:20
↓ 2 callersMethoddot
(b vec2586)
misc/luogu/p2586.go:35
↓ 2 callersFunctionequal
(a, b []int)
leetcode/biweekly/46/b/b.go:19
↓ 2 callersMethodfind
(x int)
misc/nowcoder/9224/c/c.go:23
↓ 2 callersMethodfind
(x int)
copypasta/union_find.go:325
↓ 2 callersMethodfind
(x int)
leetcode/weekly/206/c/c.go:74
↓ 2 callersMethodfindRoot
建立一条从树根到 o 的实链，然后将树根旋转到 splay 的根，并返回树根
copypasta/link_cut_tree.go:145
↓ 2 callersMethodfix
(i int)
misc/atcoder/abc170/e/e.go:40
↓ 2 callersMethodfloor
(key int)
main/500-599/558E.go:91
↓ 2 callersMethodfloor
(key int)
main/900-999/915E.go:90
↓ 2 callersMethodforeach
(do func(o *node) (Break bool))
leetcode/biweekly/55/d/d.go:147
↓ 2 callersFunctionfwt
求 OR 和 AND 时 invOp = -1 求 XOR 时 invOp = inv(2)
copypasta/math_fwt.go:67
↓ 2 callersFunctiongcd
(a, b int)
leetcode/biweekly/46/d/d.go:55
↓ 2 callersFunctiongcd91
func main() { CF891A(os.Stdin, os.Stdout) }
main/800-899/891A.go:69
↓ 2 callersFunctiongcdf
浮点数 GCD https://codeforces.com/problemset/problem/1/C
copypasta/geometry.go:161
↓ 2 callersFunctiongenRange
(st, end int)
misc/imageutil/chart.go:126
↓ 2 callersFunctiongenTemplates
(session *grequests.Session, problemURL string, isContest bool)
copypasta/template/atcoder/generator.go:214
↓ 2 callersMethodgraphEdges
todo https://codeforces.com/blog/entry/77970
main/testutil/rand.go:298
↓ 2 callersFunctioninRect
矩形 X-Y 在矩形 x-y 内
copypasta/kd_tree.go:146
↓ 2 callersMethodinRect
(l line36)
main/1000-1099/1036E.go:16
↓ 2 callersMethodintersection
直线 a b 交点 - 参数式 若求线段交点，可以在求出后判断其是否均在两条线段上：由于交点已在基线上，只需要判断交点是否在以线段为对角线的矩形内即可 NOTE: 若输入均为有理数，则输出也为有理数，对精度要求较高时可使用分数类
copypasta/geometry.go:391
↓ 2 callersFunctionisDigit
(b byte)
leetcode/weekly/58/c/c.go:8
↓ 2 callersFunctionisPalindrome
github.com/EndlessCheng/codeforces-go
leetcode/weekly/210/c/c.go:4
↓ 2 callersFunctionisPalindromic
(a []byte)
leetcode/weekly/258/c/c.go:28
↓ 2 callersMethodkth
权值线段树求第 k 小 调用前需保证 1 <= k <= rt.get()
copypasta/segment_tree.go:523
↓ 2 callersMethodlen
()
main/1300-1399/1359F.go:15
↓ 2 callersMethodlen2
()
main/600-699/613A.go:19
↓ 2 callersMethodlen2
()
misc/luogu/p2586.go:34
↓ 2 callersMethodlen2
()
misc/nowcoder/10325/c/c.go:13
↓ 2 callersMethodlen2
()
misc/atcoder/abc168/c/c.go:17
↓ 2 callersMethodless
(a, b data72)
main/300-399/372C.go:19
↓ 2 callersMethodless
(b vec)
misc/nowcoder/10325/c/c.go:15
↓ 2 callersMethodless
(a, b int)
leetcode/weekly/180/d/d.go:27
↓ 2 callersMethodless
(a, b int)
leetcode/weekly/175/c/c.go:41
↓ 2 callersFunctionlexicographicalLess
(a, b []int)
leetcode/main.go:1098
↓ 2 callersFunctionlisAll
github.com/EndlessCheng/codeforces-go
leetcode/biweekly/40/d/d.go:6
↓ 2 callersMethodlowerBound
(key int)
main/900-999/960F.go:87
↓ 2 callersMethodlowerBound
(key int)
main/gym/101628K.go:85
↓ 2 callersMethodmSize
()
copypasta/treap.go:58
↓ 2 callersMethodmaintain
(o int)
main/1300-1399/1380F.go:37
← previousnext →401–500 of 8,098, ranked by callers