MCPcopy 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"
2const int ID = 0;
3int f(int a, int b) { return a + b; }
4struct HLD {
5 int n, curhead, curloc;
6 vi sz, head, parent, loc;

Callers 7

intx.test.gen.pyFile · 0.85
primepiFunction · 0.85
integrateFunction · 0.85
find_cycleFunction · 0.85
queryMethod · 0.85
query_uptoMethod · 0.85
queryMethod · 0.85

Calls

no outgoing calls

Tested by 1

queryMethod · 0.68