./20231212/CF1208H.cpp:void modify(int bot) {
./20231212/CF1208H.cpp: for (int u = bot; u; u = fa[top[u]]) seq.push_back(u);
./20231212/CF1208H.cpp: clf[bot] ^= 1;
./20231212/CF1208H.cpp: for (int u = bot; u; u = fa[top[u]]) {
./20240123/correct/movie.cpp: } bot[N + 10];
./20240123/correct/movie.cpp: if (l == r) return bot[x].insert(b, id, hjh), ans[p] = bot[x].query(), void();
./20240123/correct/movie.cpp: if (l == r) return ans[p] = bot[x].query(), void();
./20240123/correct/teste.cpp:}bot[N+10];
./20240123/correct/teste.cpp:if(l==r)returnbot[x].insert(b,id,hjh),ans[p]=bot[x].query(),void();
./20240123/correct/teste.cpp:if(l==r)returnans[p]=bot[x].query(),void();
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: struct bot {
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: bot meko[200010];
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: struct bot {
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: bot meko[200010];
./20240229/ss-cjh/travel/travel.cpp: struct bot {
./20240229/ss-cjh/travel/travel.cpp: bot meko[200010], fky[70][2];
./20240329/ss-cjh/AE86/AE86.wa.cpp:} robot[26];
./20240329/ss-cjh/AE86/AE86.wa.cpp: for (auto e : mp) ques[e.first] = robot[me].ask(u, e.second);
./20240329/ss-cjh/AE86/AE86.wa.cpp: all = robot[me].ask(u, -1);
./20240329/ss-cjh/AE86/AE86.wa.cpp: for (int i = 0; i < K; i++) robot[i].me = i;
./20240329/ss-cjh/AE86/AE86.wa.cpp: for (int i = 0; i < K; i++) robot[i].solve(1, 0, false);
./20240404/ss-cjh/pirate/pri.cpp:struct robot {
./20240404/ss-cjh/pirate/pri.cpp: robot(LL x = 0) : mn(0) { pql.add(x), pqr.add(x); }
./20240404/ss-cjh/pirate/pri.cpp: robot bot(xn);
./20240404/ss-cjh/pirate/pri.cpp: bot.chkmin(l[i] - a[i], r[i] - a[i]);
./20240404/ss-cjh/pirate/pri.cpp: bot.aabs();
./20240404/ss-cjh/pirate/pri.cpp: auto ret = bot.query(xn);
./20240404/ss-cjh/pirate/pri.cpp: robot().print();
./20240406/ss-cjh/game/game.cpp:struct robot {
./20240406/ss-cjh/game/game.cpp: friend robot operator*(const robot& a, const robot& b) {
./20240406/ss-cjh/game/game.cpp: robot ans[N << 2][2];
./20240406/ss-cjh/game/game.cpp: robot query(int L, int R, int p, int l, int r) {
./20240406/ss-cjh/tmp/10-14-24/game.cpp:struct robot {
./20240406/ss-cjh/tmp/10-14-24/game.cpp: friend robot operator*(const robot& a, const robot& b) {
./20240406/ss-cjh/tmp/10-14-24/game.cpp: robot ans[N << 2][2];
./20240406/ss-cjh/tmp/10-14-24/game.cpp: robot query(int L, int R, int p, int l, int r) {
./20240406/ss-cjh/tmp/11-12-02/game.cpp:struct robot {
./20240406/ss-cjh/tmp/11-12-02/game.cpp: friend robot operator*(const robot& a, const robot& b) {
./20240406/ss-cjh/tmp/11-12-02/game.cpp: robot ans[N << 2][2];
./20240406/ss-cjh/tmp/11-12-02/game.cpp: robot query(int L, int R, int p, int l, int r) {
./20240406/ss-cjh/tmp/11-40-49/game.cpp:struct robot {
./20240406/ss-cjh/tmp/11-40-49/game.cpp: friend robot operator*(const robot& a, const robot& b) {
./20240406/ss-cjh/tmp/11-40-49/game.cpp: robot ans[N << 2][2];
./20240406/ss-cjh/tmp/11-40-49/game.cpp: robot query(int L, int R, int p, int l, int r) {
./20240406/ss-cjh/tmp/11-59-23/game.cpp:struct robot {
./20240406/ss-cjh/tmp/11-59-23/game.cpp: friend robot operator*(const robot& a, const robot& b) {
./20240406/ss-cjh/tmp/11-59-23/game.cpp: robot ans[N << 2][2];
./20240406/ss-cjh/tmp/11-59-23/game.cpp: robot query(int L, int R, int p, int l, int r) {
./20240408/ss-cjh/pow/pow.cpp:struct robot {
./20240408/ss-cjh/pow/pow.cpp:map<LL, word> robot::mp;
./20240408/ss-cjh/pow/pow.cpp: robot me;
./20240408/ss-cjh/pow/pow.cpp: robot you;
./20240408/ss-cjh/tmp/11-11-55/pow.cpp:struct robot {
./20240408/ss-cjh/tmp/11-11-55/pow.cpp:map<LL, word> robot::mp;
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: robot me;
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: robot you;
./20240409/becoder/a.cpp:struct robot {
./20240409/becoder/a.cpp: robot(int len = 0) : lim(len), B(sqrt(lim)), cnt(len), bf(B + 1) {
./20240409/becoder/a.cpp:void dp(int u, int topf, robot& me) {
./20240409/becoder/a.cpp: robot him{hei[v]};
./20240409/becoder/a.cpp: robot rf{hei[1]};
./20240411/c.cpp:LL solve(LL bot, LL me) {
./20240411/c.cpp: LL mep = bot <= me ? me : me + L;
./20240411/c.cpp: double x = 1.0 * (bot * K + mep) / (K + 1);
./20240411/c.cpp: if (x <= a[n << 1]) ans = min(ans, (getsuf(x) - bot) * K);
./20240411/c.cpp: LL mep = bot <= me ? me - L : me;
./20240411/c.cpp: double x = 1.0 * (bot * K - mep) / (K - 1);
./20240411/c.cpp: if (x <= a[n << 1]) ans = min(ans, (getsuf(x) - bot) * K);
./20240417/g.cpp:struct robot {
./20240417/g.cpp: robot(SAM* M, int coe) : M(M), u(1), le(0), coe(coe) {}
./20240417/g.cpp: auto dfs = [&](const auto& dfs, int u, int fa, robot bot) -> void {
./20240417/g.cpp: if (!bot.push_back(a[u])) return;
./20240417/g.cpp: fans += Mocc[bot.u];
./20240417/g.cpp: if (v != fa && !cut[v]) dfs(dfs, v, u, bot);
./20240417/g.cpp: for (int u : vec) dfs(dfs, u, 0, robot{&M, -1});
./20240417/g.cpp: robot bot) -> void {
./20240417/g.cpp: if (!bot.push_front(a[u])) return;
./20240417/g.cpp: tag[bot.u] += 1;
./20240417/g.cpp: if (!cut[v] && v != fa) dfs(dfs, tag, v, u, bot);
./20240417/g.cpp: dfs(dfs, Mt, rt, 0, robot{&M, -1});
./20240417/g.cpp: dfs(dfs, Et, rt, 0, robot{&E, +1});
./20240417/g.cpp: vector<robot> bots;
./20240417/g.cpp: auto dfs1 = [&](const auto& dfs1, int u, int fa, robot bot) -> void {
./20240417/g.cpp: if (!bot.push_back(a[u])) return;
./20240417/g.cpp: bots.push_back(bot);
./20240417/g.cpp: dfs1(dfs1, v, u, bot);
./20240417/g.cpp: for (int u : vec) dfs1(dfs1, u, 0, robot{&M, -1});
./20240417/g.cpp: auto dfs2 = [&](const auto& dfs2, int u, int fa, robot bot) -> void {
./20240417/g.cpp: if (!bot.push_back(a[u])) return;
./20240417/g.cpp: fans -= Mocc[bot.u];
./20240417/g.cpp: if (v != fa && !cut[v]) dfs2(dfs2, v, u, bot);
./20240417/g.cpp: for (auto bot : bots)
./20240417/g.cpp: if (bot.push_back(a[rt])) dfs2(dfs2, v, rt, bot);
./20240417/g.cpp: robot Mbot{&M, -1};
./20240417/g.cpp: if (Mbot.push_front(a[rt])) dfs(dfs, Mt, v, rt, Mbot);
./20240417/g.cpp: robot Ebot{&E, +1};
./20240417/g.cpp: if (Ebot.push_front(a[rt])) dfs(dfs, Et, v, rt, Ebot);
./20240419/ss-cjh/robot.cpp:struct robot {
./20240419/ss-cjh/robot.cpp: robot bot[2];
./20240419/ss-cjh/robot.cpp: bot[k].addseq((l - k) / 2, (r - k) / 2, v);
./20240419/ss-cjh/robot.cpp: cout << max(bot[0].solve(), bot[1].solve()) << endl;
./20240419/ss-cjh/robot.cpp: freopen("robot.in", "r", stdin);
./20240419/ss-cjh/robot.cpp: freopen("robot.out", "w", stdout);
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' dsy .
./20221005/test/quiz/quiz.cor.cpp://dsy on tree
./20221005/test/quiz/quiz.cpp://dsy on tree
./20221111/P1196.cpp:template<int N,class T> struct dsy{
./20221111/P1196.cpp: dsy(int n=N):cnt(n){for(int i=1;i<=N;i++) fa[i]=i,siz[i]=1,ans[i]=0;}
./20221111/P1196.cpp:dsy<30010,int> s;
./20221111/P8805.cpp:template<int N,class T> struct dsy{
./20221111/P8805.cpp: dsy(int n=N):cnt(n){for(int i=1;i<=N;i++) fa[i]=i,siz[i]=1,ans[i][0]=ans[i][1]=0;}
./20221111/P8805.cpp:dsy<200010,matrix<3,3>> s;
./20230930/test.cpp:dsu<1 << 24> dsy;
./20230930/test.cpp: dsy.merge(Lpos.prev_id(pos), Lpos.prev_id(pos - 1));
./20230930/test.cpp: dsy.merge(Lpos.prev_id(pos), Lpos.prev_id(pos - 1));
./20230930/test.cpp: for (auto &&qry: frd[i]) dsy.merge(Lpos.prev_id(qry.x), qry.y);
./20230930/test.cpp: int f = dsy.find(i);
./20231222/write/write.cpp:dsu<200010> dsy;
./20231222/write/write.cpp: dsy.merge(g[i][0].second, g[i][1].second);
./20231222/write/write.cpp: dsy.merge(a1, a2), dsy.merge(b1, b2);
./20231222/write/write.cpp: if (dsy.merge(a1, a2)) {
./20231222/write/write.cpp: dsy.merge(b1, b2);
./20240225/ss-cjh/data/data.cpp: dsu<2010> dsy;
./20240225/ss-cjh/data/data.cpp: int f = dsy.find(fa[u]);
./20240225/ss-cjh/data/data.cpp: dsy.merge(u, f);
./20240322/c.cpp:dsu<600010> dsy;
./20240322/c.cpp: a[dsy.merge(u, v)] = w;
./20240413/abc306h.cpp:dsu<17> dsy;
./20240413/abc306h.cpp: if (now == n) return f[S] = dsy.cnt == popcount(S) - 1, void();
./20240413/abc306h.cpp: int tim = dsy.cnt;
./20240413/abc306h.cpp: for (int j = 0; j < now; j++) if (conbit(S, j) && conbit(g[1 << now], j)) dsy.merge(now, j);
./20240413/abc306h.cpp: dsy.rollback(tim);
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' meko .
./20240217/ss-cjh/bus/bus.cpp:} meko, szc;
./20240217/ss-cjh/bus/bus.cpp: meko.insert(s, t);
./20240217/ss-cjh/bus/bus.cpp: meko.build();
./20240217/ss-cjh/bus/bus.cpp: cout << min(meko.query(p), szc.query(L - p + 1)) << endl;
./20240217/ss-cjh/bus/bus.cpp: debug("meko <<< %lld\n", meko.query(p));
./20240220/usaco-pt/A/a.cpp:struct meko {
./20240220/usaco-pt/A/a.cpp: meko() {
./20240220/usaco-pt/A/a.cpp:meko<1 << 20> qp3;
./20240220/usaco-pt/A/a.wa.cpp:struct meko {
./20240220/usaco-pt/A/a.wa.cpp: meko() {
./20240220/usaco-pt/A/a.wa.cpp:meko qp3;
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: bot meko[200010];
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: meko[fr].qd.push(make_pair(d, u));
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: T.insert(u, meko[u].top(u));
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: meko[z].qu.push(make_pair(dis[u] + c[u], d[u] - dist(u, z)));
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: bot meko[200010];
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: meko[fr].qd.push(make_pair(d, u));
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: T.insert(u, meko[u].top(u));
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: meko[z].qu.push(make_pair(w, d - dist(u, z)));
./20240229/ss-cjh/travel/travel.cpp: bot meko[200010], fky[70][2];
./20240229/ss-cjh/travel/travel.cpp: meko[fr].qd.push_back(make_pair(d, u));
./20240229/ss-cjh/travel/travel.cpp: T.insert(u, meko[u].top(u));
./20240229/ss-cjh/travel/travel.cpp: meko[z].qu.push(make_pair(w, d - dist(u, z)));
./20240330/ss-cjh/c/c.bf.cpp:struct meko {
./20240330/ss-cjh/c/c.bf.cpp: friend meko operator+(const meko& lhs, const meko& rhs) {
./20240330/ss-cjh/c/c.bf.cpp: friend meko operator-(const meko& lhs, const meko& rhs) {
./20240330/ss-cjh/c/c.bf.cpp: friend meko operator*(const meko& lhs, const meko& rhs) {
./20240330/ss-cjh/c/c.bf.cpp: meko operator*=(const mint& k) { return a *= k, b *= k, *this; }
./20240330/ss-cjh/c/c.bf.cpp: friend meko operator*(meko lhs, const mint& k) { return lhs *= k; }
./20240330/ss-cjh/c/c.bf.cpp:void ntt(vector<meko>& a, int op) {
./20240330/ss-cjh/c/c.bf.cpp: vector<meko> a(8);
./20240330/ss-cjh/c/c.bf.cpp:vector<meko> multiple(vector<meko> a, vector<meko> b) {
./20240330/ss-cjh/c/c.bf.cpp:vector<meko> getInv(const vector<meko>& a, int lim) {
./20240330/ss-cjh/c/c.bf.cpp: vector<meko> b{{1, 0}};
./20240330/ss-cjh/c/c.bf.cpp: vector<meko> c(a.begin(), a.begin() + min((int)a.size(), k));
./20240330/ss-cjh/c/c.bf.cpp: vector<meko> a(n + 1);
./20240330/ss-cjh/c/t.cpp:struct meko {
./20240330/ss-cjh/c/t.cpp: friend meko operator+(const meko& lhs, const meko& rhs) {
./20240330/ss-cjh/c/t.cpp: friend meko operator-(const meko& lhs, const meko& rhs) {
./20240330/ss-cjh/c/t.cpp: friend meko operator*(const meko& lhs, const meko& rhs) {
./20240330/ss-cjh/c/t.cpp: meko operator*=(const mint& k) { return a *= k, b *= k, *this; }
./20240330/ss-cjh/c/t.cpp: friend meko operator*(meko lhs, const mint& k) { return lhs *= k; }
./20240330/ss-cjh/c/t.cpp:void ntt(vector<meko>& a, int op) {
./20240330/ss-cjh/c/t.cpp: vector<meko> a(8);
./20240330/ss-cjh/c/t.cpp:vector<meko> multiple(vector<meko> a, vector<meko> b) {
./20240330/ss-cjh/c/t.cpp:vector<meko> getInv(const vector<meko>& a, int lim) {
./20240330/ss-cjh/c/t.cpp: vector<meko> b{{1, 0}};
./20240330/ss-cjh/c/t.cpp: vector<meko> c(a.begin(), a.begin() + min((int)a.size(), k));
./20240330/ss-cjh/c/t.cpp: vector<meko> a(n + 1);
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' szc .
./20240217/ss-cjh/bus/bus.cpp:} meko, szc;
./20240217/ss-cjh/bus/bus.cpp: szc.insert(L - s + 1, L - t + 1);
./20240217/ss-cjh/bus/bus.cpp: szc.build();
./20240217/ss-cjh/bus/bus.cpp: cout << min(meko.query(p), szc.query(L - p + 1)) << endl;
./20240217/ss-cjh/bus/bus.cpp: debug("szc <<< %lld\n", szc.query(L - p + 1));
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' hjh .
./20230726/test.cpp: puts("hjhyyds");
./20230726/test.cpp: puts("hjhyyds");
./20230726/test.cpp: puts("hjhyyds");
./20230726/test.cpp: puts("hjhyyds");
./20230726/test.cpp: puts("hjhyyds");
./20231211/hangzhou/f.cpp: int hjh = 0;
./20231211/hangzhou/f.cpp: for (int i = 1; i <= n; i++) hjh += hjh == w[id[i]];
./20231211/hangzhou/f.cpp: cout << min(hjh, w[id[ans]]) << endl;
./20231217/i.cpp: int hjh = solve(t, l), lzj = solve(L, l), rzj = solve(R, l + n / 2);
./20231217/i.cpp: if (hjh) {
./20231217/i.cpp: ans.emplace_back(3, hjh, n >> 1);
./20231217/i.cpp: //return merge(merge(hjh, cht), merge(lzj, rzj));
./20231217/i.cpp: make_pair(c1, hjh),
./20231222/algebra/algebra.cpp: for (int hjh = 0; hjh < m; hjh++) {
./20240123/correct/movie.cpp: void insert(LL b, int id, int hjh) {
./20240123/correct/movie.cpp: q.emplace(b, id, hjh);
./20240123/correct/movie.cpp: void insert(int x, LL b, int id, int hjh, int p, int l, int r) {
./20240123/correct/movie.cpp: if (l == r) return bot[x].insert(b, id, hjh), ans[p] = bot[x].query(), void();
./20240123/correct/movie.cpp: if (x <= mid) insert(x, b, id,hjh, p << 1, l, mid);
./20240123/correct/movie.cpp: else insert(x, b, id,hjh, p << 1 | 1, mid + 1, r);
./20240123/correct/movie.cpp: cout << "hjhakioi" << endl;
./20240123/correct/teste.cpp:voidinsert(LLb,intid,inthjh){
./20240123/correct/teste.cpp:q.emplace(b,id,hjh);
./20240123/correct/teste.cpp:voidinsert(intx,LLb,intid,inthjh,intp,intl,intr){
./20240123/correct/teste.cpp:if(l==r)returnbot[x].insert(b,id,hjh),ans[p]=bot[x].query(),void();
./20240123/correct/teste.cpp:if(x<=mid)insert(x,b,id,hjh,p<<1,l,mid);
./20240123/correct/teste.cpp:elseinsert(x,b,id,hjh,p<<1|1,mid+1,r);
./20240123/correct/teste.cpp:cout<<"hjhakioi"<<endl;
./20240220/usaco-pt/A/a.wa.cpp:auto hjh = T.query(1, p, 1, 1, n);
./20240220/usaco-pt/A/a.wa.cpp: debug("hjh = (%lld, %lld, %lld, %d)\n", hjh.sum, hjh.mn, hjh.ms, hjh.mct);
./20240220/usaco-pt/A/a.wa.cpp:assert(hjh.mct == tmp && hjh.mn == ret.mn + vaild);
./20240221/ss-cjh/bs/bs.cpp: int hjh = 0;
./20240221/ss-cjh/bs/bs.cpp: for (int i = 1; i <= t; i++) hjh += a[i] >= i;
./20240221/ss-cjh/bs/bs.cpp: cout << hjh << endl;
./20240401/ss-cjh/stick/stick.cpp:struct hjhsegtree {
./20240401/ss-cjh/stick/stick.cpp:hjhsegtree<4010> hjh;
./20240401/ss-cjh/stick/stick.cpp: hjh.build(f, 1, 1, tot);
./20240401/ss-cjh/stick/stick.cpp: for (int j : buc[i]) hjh.modify(j, tot, -1, 1, 1, tot);
./20240401/ss-cjh/stick/stick.cpp: g[i] = min(g[i], hjh.query(i, tot, 1, 1, tot));
./20240402/ss-cjh/decapitation/deca.cpp:void solvehjh(int l, int r) {
./20240402/ss-cjh/decapitation/deca.cpp: solvehjh(l, mid);
./20240402/ss-cjh/decapitation/deca.cpp: solvehjh(mid + 1, r);
./20240402/ss-cjh/decapitation/deca.cpp: solvehjh(1, n);
./20240412/ss-cjh/s.cpp:LL hjh[500010];
./20240412/ss-cjh/s.cpp: hjh[p.x] = max(hjh[p.x], p.y), debug("hjh[%lld] <- %lld\n", p.x, p.y);
./20240412/ss-cjh/s.cpp: if (hjh[i]) convex.push_back({i, hjh[i]});
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' dxw .
./20240401/ss-cjh/stick/stick.cpp:fenwick<4010> dxw[2];
./20240401/ss-cjh/stick/stick.cpp: dxw[0].clear(), dxw[1].clear();
./20240401/ss-cjh/stick/stick.cpp: g[i] = min(g[i], hua[i] / k + min(dxw[0].query(id[i] - 1) + 1, dxw[1].query(huk.size() - id[i] + 1)));
./20240401/ss-cjh/stick/stick.cpp: dxw[0].add(id[i], f[i] - hua[i] / k);
./20240401/ss-cjh/stick/stick.cpp: dxw[1].add(huk.size() - id[i] + 1, f[i] - hua[i] / k);
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' lzj .
./20231216/cf70d.cpp:Jason cht, lzj;
./20231216/cf70d.cpp: if (op == 1) cht.insert({x, y}), lzj.insert({x, -y});
./20231216/cf70d.cpp: else cout << (cht.checkIn({x, y}) && lzj.checkIn({x, -y}) ? "YES" : "NO") << endl;
./20231216/cf70d.cpp: for (auto p : lzj.s) debug("(%lld, %lld), ", p.x, p.y);
./20231217/i.cpp: int hjh = solve(t, l), lzj = solve(L, l), rzj = solve(R, l + n / 2);
./20231217/i.cpp: //return merge(merge(hjh, cht), merge(lzj, rzj));
./20231217/i.cpp: make_pair(c2, lzj),
./20231217/j.cpp:set<int> lzj;
./20231217/j.cpp: for (int i = 1; i <= n + 1; i++) s.insert({i, i, i - 1}), lzj.insert(i);
./20231217/j.cpp: while (lzj.lower_bound(l) != lzj.end() && *lzj.lower_bound(l) <= r) {
./20231217/j.cpp: ans[*lzj.lower_bound(l)] = i;
./20231217/j.cpp: lzj.erase(lzj.lower_bound(l));
./20231217/j.cpp: for (int x : lzj) ans[x] = n + 1;
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' -w cp .
./20230930/07D/std.cpp:const int cp=1e9+7;
./20230930/07D/std.cpp:inline int mod(int x){return x+(x<0?cp:0)-(x>=cp?cp:0);}
./20230930/07D/std.cpp:inline int ksm(int a, int b=cp-2){
./20230930/07D/std.cpp: for(; b; b>>=1, a=1ll*a*a%cp)
./20230930/07D/std.cpp: if(b&1) ret=1ll*ret*a%cp;
./20230930/07D/std.cpp:const int inv2=cp+1>>1;
./20230930/07D/std.cpp: pre[0]=1;for(int i=2; i<=lim; ++i) pre[i]=1ll*pre[i-2]*(i-1)%cp;
./20230930/07D/std.cpp: for(int j=0, t=(i&1)?(cp-1):1; j<=i/2; ++j)
./20230930/07D/std.cpp: plust(op[i], 1ll*t*C[i][j+j]%cp*pre[j+j]%cp), t=mod(-t-t);
./20230930/07D/std.cpp: if(d[i]==3) ++c2, opr=1ll*opr*inv2%cp;else ++c1;
./20230930/07D/std.cpp: for(int j=0; j<=c2; ++j) plust(g[c1+(j<<1)], 1ll*f[i-1][c]*opr%cp*C[c2][j]%cp*op[c2-j]%cp);
./20230930/07D/std.cpp: plust(g[j], 1ll*g[i]*C[i][j]%cp*pre[i-j]%cp);
./20230930/07D/std.cpp: opr=1;for(int i=0; i<=n-c+1; ++i) opr=1ll*opr*max(i, 1)%cp, plust(f[c][i+c], 1ll*g[i]*opr%cp);
./20240404/ss-cjh/game/game.cpp:typedef complex<double> cp;
./20240404/ss-cjh/game/game.cpp:void fft(vector<cp> &a, int op) {
./20240404/ss-cjh/game/game.cpp: static cp w[1000010];
./20240404/ss-cjh/game/game.cpp: cp wn(cos(2 * pi / len), op * sin(2 * pi / len));
./20240404/ss-cjh/game/game.cpp: cp x = a[i + j], y = a[i + j + k] * w[j];
./20240404/ss-cjh/game/game.cpp: // vector<cp> c(len), d(len);
./20240404/ss-cjh/tmp/11-42-15/game.cpp:typedef complex<double> cp;
./20240404/ss-cjh/tmp/11-42-15/game.cpp:void fft(vector<cp>& a, int op) {
./20240404/ss-cjh/tmp/11-42-15/game.cpp: static cp w[1000010];
./20240404/ss-cjh/tmp/11-42-15/game.cpp: cp wn(cos(2 * pi / len), op * sin(2 * pi / len));
./20240404/ss-cjh/tmp/11-42-15/game.cpp: cp x = a[i + j], y = a[i + j + k] * w[j];
./20240404/ss-cjh/tmp/11-42-15/game.cpp: vector<cp> c(len), d(len);
./20240404/ss-cjh/tmp/11-56-13/game.cpp:typedef complex<double> cp;
./20240404/ss-cjh/tmp/11-56-13/game.cpp:void fft(vector<cp>& a, int op) {
./20240404/ss-cjh/tmp/11-56-13/game.cpp: static cp w[1000010];
./20240404/ss-cjh/tmp/11-56-13/game.cpp: cp wn(cos(2 * pi / len), op * sin(2 * pi / len));
./20240404/ss-cjh/tmp/11-56-13/game.cpp: cp x = a[i + j], y = a[i + j + k] * w[j];
./20240404/ss-cjh/tmp/11-56-13/game.cpp://vector<cp> c(len), d(len);
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' cht .
./20231216/cf70d.cpp:Jason cht, lzj;
./20231216/cf70d.cpp: if (op == 1) cht.insert({x, y}), lzj.insert({x, -y});
./20231216/cf70d.cpp: else cout << (cht.checkIn({x, y}) && lzj.checkIn({x, -y}) ? "YES" : "NO") << endl;
./20231216/cf70d.cpp: for (auto p : cht.s) debug("(%lld, %lld), ", p.x, p.y);
./20231217/i.cpp: int cht = 0;
./20231217/i.cpp: cht = ans.size();
./20231217/i.cpp: //return merge(merge(hjh, cht), merge(lzj, rzj));
./20231217/i.cpp: make_pair(c1, cht),
./20231217/j.cpp: vector<pair<int, int>> cht;
./20231217/j.cpp: if (ret != make_pair(0, -1)) cht.push_back(ret);
./20231217/j.cpp: sort(cht.begin(), cht.end());
./20231217/j.cpp: cht.push_back({n + 1, n + 1});
./20231217/j.cpp: for (auto& elem : cht) {
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' -w me .
./20240223/ss-cjh/b-refactor/interactive_lib.cpp:namespace me = __internal::yukimianyan;
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: r = me::findmax(x, y) < me::findmax(y, x);
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: for (int i = 1; i <= me::g.cnt; i++)
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: if (me::g[i].u == x && me::g[i].v == y) me::cut[i] = me::cut[i ^ 1] = true;
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: me::g.link(u, v, false);
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: me::dp(1, 0);
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: for (int i = 1; i <= me::g.cnt; i++) L = max(L, me::g[i].w);
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: tuple<LL, int, int> top(int me) {
./20240229/ss-cjh/tmp/11-43-46/travel.cpp: return qu.empty() ? inf : make_tuple(qu.top().first, qd.top().second, me);
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: tuple<LL, int, int> top(int me) {
./20240229/ss-cjh/tmp/12-12-45/travel.cpp: return qu.empty() ? inf : make_tuple(qu.top().first, qd.top().second, me);
./20240229/ss-cjh/travel/travel.cpp: tuple<LL, int, int> top(int me) {
./20240229/ss-cjh/travel/travel.cpp: return qu.empty() ? inf : make_tuple(qu.top().first, qd.back().second, me);
./20240329/482-down/t1/hat.cpp: return 1;// Believe me.
./20240329/ss-cjh/AE86/AE86.wa.cpp: int me;
./20240329/ss-cjh/AE86/AE86.wa.cpp: if (col[u] == me && det[u] >= 0) buc[det[u]] += k, tot += k;
./20240329/ss-cjh/AE86/AE86.wa.cpp: if (col[u] == me) det[u] = mp.count(det[u] % T) ? mp[det[u] % T] : -1, rsz[u] = 1;
./20240329/ss-cjh/AE86/AE86.wa.cpp: void askall(int me, int u) {
./20240329/ss-cjh/AE86/AE86.wa.cpp: for (auto e : mp) ques[e.first] = robot[me].ask(u, e.second);
./20240329/ss-cjh/AE86/AE86.wa.cpp: all = robot[me].ask(u, -1);
./20240329/ss-cjh/AE86/AE86.wa.cpp: for (int i = 0; i < K; i++) robot[i].me = i;
./20240331/vjudge/d.dp.cpp://static int me = 3;
./20240331/vjudge/d.dp.cpp://if (ans[x - 1] > me) ch = '>', me += 1;
./20240331/vjudge/d.dp.cpp://else if (ans[x - 1] < me) ch = '<', me -= 1;
./20240402/ss-cjh/war/war.cpp: auto ckm = [&, me = u](int u, int k) {
./20240402/ss-cjh/war/war.cpp: if (l < x || r > y || u == me) {
./20240402/ss-cjh/war/war.cpp: key[r].emplace_back(l, dep[me]);
./20240402/ss-cjh/war/war.cpp: debug("u = %d, => [%d, %d]\n", me, l, r);
./20240404/ss-cjh/tmp/11-28-37/game.cpp: node me = binom.gfac(n - i * k - 1) / binom.gfac(cst) / binom.gfac(i);
./20240404/ss-cjh/tmp/11-28-37/game.cpp: mint part1 = (i & 1 ? -1 : 1) * (me.q ? mint(0) : me.v);
./20240404/ss-cjh/tmp/11-42-15/game.cpp: node me = binom.gfac(n - i * k - 1) / binom.gfac(cst) / binom.gfac(i);
./20240404/ss-cjh/tmp/11-42-15/game.cpp: mint part1 = (i & 1 ? -1 : 1) * (me.q ? mint(0) : me.v);
./20240404/ss-cjh/tmp/11-56-13/game.cpp: node me = binom.gfac(n - i * k - 1) / binom.gfac(cst) / binom.gfac(i);
./20240404/ss-cjh/tmp/11-56-13/game.cpp: mint part1 = (i & 1 ? -1 : 1) * (me.q ? mint(0) : me.v);
./20240408/ss-cjh/pow/pow.cpp: robot me;
./20240408/ss-cjh/pow/pow.cpp: me.add(dvs[j]);
./20240408/ss-cjh/pow/pow.cpp: mp[me.w1] += 1;
./20240408/ss-cjh/pow/pow.cpp: debug("add [%d, %d] into mp: hash code = %llu\n", i, j, me.w1);
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: robot me;
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: me.add(dvs[j]);
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: mp[me.w1] += 1;
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: debug("add [%d, %d] into mp: hash code = %llu\n", i, j, me.w1);
./20240409/becoder/a.cpp:void dp(int u, int topf, robot& me) {
./20240409/becoder/a.cpp: if (son[u]) dp(son[u], topf, me);
./20240409/becoder/a.cpp: f[d] += 1ll * him.cnt[j - 1] * me.query(d, (dep[u] - dep[topf]) % d);
./20240409/becoder/a.cpp: me.add(dep[u] - dep[topf] + j, him.cnt[j - 1]);
./20240409/becoder/a.cpp: me.add(dep[u] - dep[topf], 1);
./20240411/c.cpp:LL solve(LL bot, LL me) {
./20240411/c.cpp: LL mep = bot <= me ? me : me + L;
./20240411/c.cpp: LL mep = bot <= me ? me - L : me;
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' -w you .
./20240404/ss-cjh/tmp/11-28-37/game.cpp: debug("you are humorous\n");
./20240404/ss-cjh/tmp/11-42-15/game.cpp: debug("you are humorous\n");
./20240404/ss-cjh/tmp/11-56-13/game.cpp: debug("you are humorous\n");
./20240408/ss-cjh/pow/pow.cpp: robot you;
./20240408/ss-cjh/pow/pow.cpp: you.add(dvs[j]);
./20240408/ss-cjh/pow/pow.cpp: ans += mp[you.w2];
./20240408/ss-cjh/pow/pow.cpp: debug("query [%d, %d] in mp: hash code = %llu\n", j, i - 1, you.w2);
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: robot you;
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: you.add(dvs[j]);
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: ans += mp[you.w2];
./20240408/ss-cjh/tmp/11-11-55/pow.cpp: debug("query [%d, %d] in mp: hash code = %llu\n", j, i - 1, you.w2);
./20231215/color.cpp: void I(){for (int i=1;i<=m;i++)a[i][i]=1;}
./20240216/mirror.cpp:node I[500010], E = node{inf + 1, -inf - 1}; // E 是單位元
./20240216/mirror.cpp: I[i] = cap(L, R);
./20240216/mirror.cpp: debug("I[%d] = [%lld, %lld]\n", i, I[i].l, I[i].r);
./20240216/mirror.cpp: if (!I[i].empty()) assert(I[i].l == -inf || I[i].r == inf);
./20240216/mirror.cpp: I[i] = append(E, I[i]);
./20240216/mirror.cpp: rel[l] = merge(I[l], rel[l + 1]);
./20240216/mirror.cpp: rer = merge(rer, I[r]);
./20240223/ss-cjh/b/b.cpp: static constexpr word I = 1;
./20240223/ss-cjh/b/b.cpp: if (!k) v -= I << (x - 1);
./20240223/ss-cjh/b/b.cpp: if (k) v += I << (x - 1);
./20240223/ss-cjh/b/b.cpp: bint& V = f[u] = {(bint::I << 100) - 1};
./20240223/ss-cjh/b-refactor/fuck.cpp: static constexpr word I = 1;
./20240223/ss-cjh/b-refactor/fuck.cpp: if (!k) v -= I << (x - 1);
./20240223/ss-cjh/b-refactor/fuck.cpp: if (k) v += I << (x - 1);
./20240223/ss-cjh/b-refactor/fuck.cpp: bint& V = f[u] = {(bint::I << 100) - 1};
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: static constexpr word I = 1;
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: if (!k) v -= I << (x - 1);
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: if (k) v += I << (x - 1);
./20240223/ss-cjh/b-refactor/interactive_lib.cpp: bint& V = f[u] = {(bint::I << 100) - 1};
./20240226/ss-cjh/flood/flood.bf.cpp: poly c(2 * m + 2), I(2 * m + 2);
./20240226/ss-cjh/flood/flood.bf.cpp: I[1] = 1;
./20240226/ss-cjh/flood/flood.bf.cpp: I[2 * m + 1] = 1;
./20240226/ss-cjh/flood/flood.bf.cpp: cout << multiple(c, qpow(I, n))[m - 1] << endl;
./20240406/ss-cjh/a/std.cpp:__int128 I = 1;
./20240406/ss-cjh/a/std.cpp: for (; x; x >>= 1, a = I * a * a % MOD)
./20240406/ss-cjh/a/std.cpp: z = I * z * a % MOD;
./20240406/ss-cjh/a/std.cpp: v = I * u * u % p;
./20240406/ss-cjh/a/std.cpp: t = (I * t * t + c) % n;
./20240406/ss-cjh/a/std.cpp: tmp = I * tmp * abs(t - s) % n;
./20240419/ss-cjh/future.cpp: vector<int> I;
./20240419/ss-cjh/future.cpp: for (int i = l; i <= r; i++) I.push_back(i);
./20240419/ss-cjh/future.cpp: for (int i = l; i < lb * B; i++) I.push_back(i);
./20240419/ss-cjh/future.cpp: for (int i = r; i >= (rb + 1) * B; i--) I.push_back(i);
./20240419/ss-cjh/future.cpp: return make_tuple(lb, rb, I);
./20240419/ss-cjh/future.cpp: auto&& [lb, rb, I] = split(l, r);
./20240419/ss-cjh/future.cpp: if (!I.empty()) {
./20240419/ss-cjh/future.cpp: vector<int> bs = {I.front() / B, I.back() / B};
./20240419/ss-cjh/future.cpp: for (int i : I) {
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ grep -r --include='*.cpp' cjh .
minni@LAPTOP-VTBPQCQP:/mnt/e/codes/contests$ echo ?
?