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
↓ 3 callersMethodmax
()
leetcode/weekly/236/d/d.go:107
↓ 3 callersMethodmerge
(from, to int)
leetcode/weekly/254/d/d.go:57
↓ 3 callersMethodmerge
(from, to int)
leetcode/weekly/205/d/d.go:20
↓ 3 callersFunctionmin
(a, b int)
misc/acwing/weekly/12/c/c.go:107
↓ 3 callersFunctionmin
(a, b int)
misc/nowcoder/9476/c/c.go:47
↓ 3 callersFunctionmin
(a, b int)
leetcode/biweekly/56/d/d.go:36
↓ 3 callersFunctionmin
(a, b int)
leetcode/weekly/143/c/c.go:37
↓ 3 callersFunctionmin
(a, b int)
leetcode/weekly/217/d/d.go:36
↓ 3 callersFunctionmin
(a, b int)
leetcode/weekly/255/c/c.go:48
↓ 3 callersMethodmin
()
leetcode/weekly/236/d/d.go:100
↓ 3 callersFunctionmin52
(a, b int64)
main/1-99/52C.go:109
↓ 3 callersFunctionmul
(a, b mat)
main/edu/2/segmenttree1/step4/b/main.go:18
↓ 3 callersFunctionnewMatrix
(n, m int)
copypasta/math_matrix.go:66
↓ 3 callersFunctionnewNTT
(n int)
copypasta/math_ntt.go:111
↓ 3 callersFunctionnewTreap
()
leetcode/weekly/236/d/d.go:126
↓ 3 callersMethodnext
(int)
copypasta/odt_bst.go:25
↓ 3 callersMethodpop
()
main/400-499/487B.go:27
↓ 3 callersMethodpop
()
copypasta/graph.go:973
↓ 3 callersMethodpow
(x int64, n int)
main/1100-1199/1114F.go:17
↓ 3 callersMethodprev
前驱（小于 key，且最大的数） 等价于 floor(key-1)
copypasta/bst.go:130
↓ 3 callersMethodpush
(v int)
main/400-499/487B.go:17
↓ 3 callersMethodpush
(v pair73)
main/1400-1499/1473E.go:22
↓ 3 callersMethodpushDown
()
copypasta/bst.go:51
↓ 3 callersMethodpushUp
()
main/500-599/527C_treap.go:26
↓ 3 callersMethodpushUp
()
leetcode/weekly/175/c/c.go:18
↓ 3 callersMethodput
(key int)
main/300-399/387E.go:62
↓ 3 callersMethodput
(int, int)
copypasta/bst.go:165
↓ 3 callersMethodput
(key entry)
leetcode/biweekly/55/d/d.go:123
↓ 3 callersMethodput
(key int)
leetcode/weekly/180/d/d.go:53
↓ 3 callersMethodput1
(l, r int, val tpValueType)
copypasta/odt_bst.go:23
↓ 3 callersMethodrank
(key int)
leetcode/weekly/175/c/c.go:70
↓ 3 callersMethodrotate
()
copypasta/link_cut_tree.go:77
↓ 3 callersMethodrotate
旋转，并维护子树大小 d=0：左旋，返回 o 的右儿子 d=1：右旋，返回 o 的左儿子
copypasta/splay.go:63
↓ 3 callersMethodrotateCCW
(float64)
copypasta/geometry.go:1111
↓ 3 callersMethodsVal
()
copypasta/leftist_tree.go:25
↓ 3 callersMethodsize
()
main/1300-1399/1398E.go:30
↓ 3 callersMethodsize
()
copypasta/bst.go:80
↓ 3 callersMethodsplay
将 o 旋转到 splay 的根 由于直接从 o 出发旋转到根，所以要先把标记从根传递到 o 的子节点（注意不是 o），再旋转
copypasta/link_cut_tree.go:104
↓ 3 callersMethodsplit
[l, r] => [l, mid-1] [mid, r] return index of [mid, r] return len(t) if not found
copypasta/odt.go:29
↓ 3 callersFunctionstr2int
(s string)
leetcode/weekly/243/a/a.go:8
↓ 3 callersMethodsub
(b vec36)
main/1000-1099/1036E.go:13
↓ 3 callersMethodsub
(b vecF)
main/1-99/1C.go:12
↓ 3 callersMethodsub
(b poly)
copypasta/math_ntt.go:230
↓ 3 callersMethodsum
(i int)
leetcode/weekly/214/d/d.go:16
↓ 3 callersFunctiontoRawString
(v reflect.Value)
leetcode/testutil/leetcode.go:169
↓ 3 callersMethodtop
()
main/400-499/487B.go:36
↓ 3 callersMethodtop
()
misc/atcoder/abc170/e/e.go:25
↓ 3 callersMethodtreeEdges
随机父节点 期望树高 https://blog.csdn.net/EI_Captain/article/details/109910307 更严格的随机树见 https://mivik.blog.luogu.org/the-art-of-randomness
main/testutil/rand.go:265
↓ 3 callersMethodupdate
(o, l, r int, v int64)
main/edu/2/segmenttree2/step4/b/main.go:44
↓ 3 callersMethodupdate
(o, l, r, v int)
main/1-99/52C.go:42
↓ 3 callersMethodupdate
(o, l, r, v int)
misc/acwing/weekly/12/c/c.go:39
↓ 3 callersMethodupdate
(o, l, r, v int, mul bool)
leetcode/biweekly/37/d/d.go:45
↓ 3 callersFunctionupdateComment
(cmt string)
copypasta/template/leetcode/generator.go:590
↓ 2 callersFunctionAssertEqualRunResults
对拍 runFuncAC 为暴力逻辑或已 AC 逻辑，runFunc 为当前测试的逻辑
main/testutil/testutil.go:167
↓ 2 callersFunctionCF1023E
github.com/EndlessCheng/codeforces-go
main/1000-1099/1023E.go:16
↓ 2 callersFunctionCF1174F
github.com/EndlessCheng/codeforces-go
main/1100-1199/1174F.go:23
↓ 2 callersFunctionCF1363D
github.com/EndlessCheng/codeforces-go
main/1300-1399/1363D.go:21
↓ 2 callersFunctionCF1479A
github.com/EndlessCheng/codeforces-go
main/1400-1499/1479A.go:18
↓ 2 callersFunctionCF1486C2
github.com/EndlessCheng/codeforces-go
main/1400-1499/1486C2.go:16
↓ 2 callersMethodGet
(key string, timestamp int)
leetcode/weekly/121/b/b.go:23
↓ 2 callersFunctionGetBiweeklyContestID
(contestID int)
copypasta/template/leetcode/tag.go:27
↓ 2 callersFunctionGetWeeklyContestID
id > 0，指定具体的一场周赛 id = 0，指定下一场或当前正在进行的周赛 id < 0，指定上 |id| 场周赛（例如 id = -1 表示最近的一场结束的周赛）
copypasta/template/leetcode/tag.go:12
↓ 2 callersFunctionLPS
(s []byte)
leetcode/weekly/229/d/d.go:22
↓ 2 callersMethodLen
()
main/1300-1399/1398E.go:134
↓ 2 callersMethodLen
()
main/1100-1199/1106E.go:18
↓ 2 callersMethodLen
()
main/600-699/650C_test.go:45
↓ 2 callersMethodLen
()
main/1000-1099/1076D.go:17
↓ 2 callersMethodLen
()
misc/nowcoder/6629/c/c.go:8
↓ 2 callersMethodPop
()
copypasta/graph.go:3465
↓ 2 callersMethodPop
()
leetcode/weekly/151/d/d.go:12
↓ 2 callersMethodPop
()
leetcode/weekly/233/b/b.go:14
↓ 2 callersMethodPush
(v interface{})
misc/atcoder/abc170/e/e.go:20
↓ 2 callersMethodPush
处于堆中的节点的 d 值不会改变，所以可以直接比较
copypasta/graph.go:3464
↓ 2 callersMethodPush
(v interface{})
leetcode/weekly/233/b/b.go:13
↓ 2 callersMethodPushFront
(v interface{})
copypasta/deque.go:19
↓ 2 callersMethodRsh
右移 k 位
copypasta/bits.go:204
↓ 2 callersMethodTreeEdges
TreeEdges generates a tree with n nodes, st-index, and v<w for each edge v-w. TODO: support set max degree limit
main/testutil/rand.go:278
↓ 2 callersMethodUniqueSlice
UniqueSlice generates a int slice with a fixed size and all ints are unique within range [min, max]
main/testutil/rand.go:186
↓ 2 callersMethod_core
(minL, cntL, minR, cntR int)
main/edu/2/segmenttree1/step1/c/main.go:18
↓ 2 callersMethod_merge
(p *ltNode)
copypasta/leftist_tree.go:39
↓ 2 callersFunction_parseReturnType
(line string)
copypasta/template/leetcode/helper.go:119
↓ 2 callersMethod_pushUp
(o int)
main/1300-1399/1321E.go:23
↓ 2 callersMethod_pushUp
(o int)
main/300-399/339D.go:16
↓ 2 callersMethod_pushUp
(o int)
main/900-999/920F.go:17
↓ 2 callersMethod_pushUp
(o int)
main/900-999/914D.go:19
↓ 2 callersMethod_pushUp
(o int)
main/1100-1199/1114F.go:28
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step3/b/main.go:12
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step1/c/main.go:28
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step1/b/main.go:25
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step2/a/main.go:37
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step2/d/main.go:25
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step2/c/main.go:25
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step2/b/main.go:18
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step4/a/main.go:18
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step4/e/main.go:19
↓ 2 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step4/c/main.go:16
↓ 2 callersMethod_pushUp
(o int)
main/200-299/242E.go:16
↓ 2 callersMethod_pushUp
(o int)
leetcode/weekly/186/d/d.go:12
↓ 2 callersMethod_set
(o, val int)
main/edu/2/segmenttree1/step2/a/main.go:28
↓ 2 callersMethod_spread
(o int)
main/1100-1199/1114F.go:47
← previousnext →301–400 of 8,098, ranked by callers