uid001

摘要： const int N = 2e5+10; const int M = 500; int cnt, p[N], _gcd[M][M]; int v[N][3],vis[N]; int gcd(int x, int y) { int g = 1; REP(i,0,2) { int tmp; if (v[x][i]>=M) { if (y%v[x][i]==0) tmp = v[x... 阅读全文