不难发现,这是个 i->pi的置换
对于样例1,即为置换(6 1)(5 4 3 8 2)(9 7)
题目即让构造ax + b y = n
x个a次置换,y个b次置换
ll exgcd(ll a, ll b, ll &x, ll &y){
if(!b){
x = 1, y = 0;
return a;
}
int d = exgcd(b, a%b, y, x);
y -= x*(a/
不难发现,这是个 i->pi的置换
对于样例1,即为置换(6 1)(5 4 3 8 2)(9 7)
题目即让构造ax + b y = n
x个a次置换,y个b次置换
ll exgcd(ll a, ll b, ll &x, ll &y){
if(!b){
x = 1, y = 0;
return a;
}
int d = exgcd(b, a%b, y, x);
y -= x*(a/