miller_rabin判质数 pollard_rho分解质数模板.docVIP

miller_rabin判质数 pollard_rho分解质数模板 #include cstdio #include cstdlib #include cstring #include cmath #include iostream #include algorithm #include queue using namespace std; #define INF 0x3fffffff #define LL long long #define N 4000005 /***筛出小于N的质数**/ bool ispri[N]; int prime[N], np; void make_prime() { int i, j; memset(ispri, 0, sizeof(ispri)); for(i = 2, np = 0; i N; i++) { if(!ispri[i]) { prime[++np] = i; for (j = 2 * i; j N; j += i) { ispri[j] = 1; } } } //printf(make prime end\