MCPcopy Create free account
hub / github.com/ShahjalalShohag/code-library / fix

Method fix

Data Structures/Segment Tree 2D Dynamic.cpp:116–121  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

114 b = st, e = en;
115 }
116 void fix(int pos) {
117 long long val = 0;
118 if (l) val = __gcd(val, l->t.query(pos, pos));
119 if (r) val = __gcd(val, r->t.query(pos, pos));
120 t.insert(pos, val);
121 }
122 void upd(int x, int y, long long val) { //set a[x][y] = val
123 if (e < x || x < b) return;
124 if (b == e) {

Callers

nothing calls this directly

Calls 2

queryMethod · 0.45
insertMethod · 0.45

Tested by

no test coverage detected