Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/SuprDewd/CompetitiveProgramming
/ f
Function
f
code/graph/hld.cpp:3–3 ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
1
#include
"../data-structures/segment_tree.cpp"
2
const int ID = 0;
3
int f(int a, int b) { return a + b; }
4
struct HLD {
5
int n, curhead, curloc;
6
vi sz, head, parent, loc;
Callers
7
intx.test.gen.py
File · 0.85
primepi
Function · 0.85
integrate
Function · 0.85
find_cycle
Function · 0.85
query
Method · 0.85
query_upto
Method · 0.85
query
Method · 0.85
Calls
no outgoing calls
Tested by
1
query
Method · 0.68