excrt扩展剩余定理#include<iostream>#include<cstring>#include<vector>#include<cstring>#include<cmath>#
n个同余方程顺序做n次exgcd,每次以累计lcm作exgcd主元,以新mod作mod,每次ans累加一个exgcd最小值,记得每次ans取累计lcm保证最小正【模板】扩展中国剩余定理(EXCRT) - 洛谷#include<iostream>#include<cstring>#include<vector>#include<cstring>#include<cmath&