摘要：
gxx的素数判定模板typedef long long LL;bool primeTest(LL n, LL b) { LL m = n - 1; LL counter = 0; while ((m & 1) == 0) { m >>= 1; counter ++; } LL ret = powMod(b, m, n); if (ret == 1 || ret == n - 1) { return true; } counter --; while (counter >= 0) { r... 阅读全文
