Primality by Wilson's theorem: Difference between revisions

m
C++ - simplified code
(Added C++ solution)
m (C++ - simplified code)
Line 500:
int factorial_mod(int n, int p) {
unsigned int f = 1;
for (; n > 0 && f > 0; --n) {
f = (f * n) % p;
if (f == 0)
break;
}
return f;
}
1,777

edits