• 2024-12-17Schreier–Sims 算法
    好看的实现。#include<bits/stdc++.h>usingnamespacestd;#defineintlonglongconstintmaxn=105;intn,q;structperm{intp[maxn];};permoperator*(perma,permb){ permc; for(inti=1;i<=n;i++)c.p[i]=a.p[b.p[i]]; returnc;}perminv(perma){ p