This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub morioprog/cpplib
#include "math/prime/is_prime.hpp"
素数判定する.
$O(\sqrt{n})$
is_prime(N)
bool
/** * @brief 素数判定 * @docs docs/math/prime/is_prime.md */ bool is_prime(long long n) { if (n < 2) return false; for (int i = 2; i * i <= n; ++i) if (n % i == 0) return false; return true; }
#line 1 "math/prime/is_prime.hpp" /** * @brief 素数判定 * @docs docs/math/prime/is_prime.md */ bool is_prime(long long n) { if (n < 2) return false; for (int i = 2; i * i <= n; ++i) if (n % i == 0) return false; return true; }