```c++
bool isPrime(a) {
+ if (a < 2) return 0;
for (int i = 2; i < a; ++i)
if (a % i == 0) return 0;
return 1;
```c++
bool isPrime(a) {
+ if (a < 2) return 0;
for (int i = 2; i * i <= a; ++i)
if (a % i) return 0;
return 1;
```c++
bool millerRabin(int n) {
+ if (n < 3) return n == 2;
for (int i = 1; i <= s; ++i) {
int a = rand() % (n - 2) + 2;
if (quickPow(a, n - 1, n) != 1) return 0;
```c++
bool millerRabbin(int n) {
+ if (n < 3) return n == 2;
int a = n - 1, b = 0;
while (a % 2 == 0) a /= 2, ++b;
for (int i = 1, j; i <= s; ++i) {