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\n); } /********************/ long long mult_mod(long long x, long long y, long long n) { long long t, T, a, b, c, d, e, f, g, h, v, ans; T = (long long)(sqrt(double(n) + 0.5)); t = T * T - n; a = x / T; b = x % T; c = y / T; d = y % T; e = a * c / T; f = a * c % T; v = ((a * d + b * c) % n + e * t) % n; g = v / T; h = v % T; ans = (((f + g) * t % n + b * d) % n + h * T) % n; while(ans 0) ans += n; return ans; } long long fun(long long m, long long n) { long long a, ans = 1; rand(); a = rand(); a *= rand() % (n - 1); a *= rand() % (n - 1); a = a % (n - 1) + 1; while(m) { if(m 1) ans = mult_mod(ans, a, n); m = 1; a = mult_mod(a, a, n); } return ans; } long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } long long f(long long x, long long n) { return (mult_mod(x, x, n) + 1) % n; } //判断一个数是不是质数 int miller_rabin(long long n) { if(n == 2) return 1; if(n 2 || (n 1) == 0) return 0; long long m = n - 1, s = 0, a, i, j; while(!(m 1)) { m = 1; s++; } for(i = 1; i = 10; i++) { a = fun(m, n); if(a == 1) continue; for(j = 1; j = s; j++) { if(a == n - 1) break; a = mult_mod(a, a, n); } if(j s) re