素数判定
(math/is-prime.hpp)

• View this file on GitHub
• Last update: 2022-11-17 17:56:55+09:00
• Include: #include "math/is-prime.hpp"
• Link: View error logs on GitHub Actions

Verified with

• verify/AOJ-ALDS1_1_C.test.cpp

Code

#pragma once
template <class T>
bool isPrime(const T &t){
  if(t == 2) return true;
  for(T i = 2; i * i <= t; ++i){
    if(t % i == 0) return false;
  }
  return true;
}

#line 2 "math/is-prime.hpp"
template <class T>
bool isPrime(const T &t){
  if(t == 2) return true;
  for(T i = 2; i * i <= t; ++i){
    if(t % i == 0) return false;
  }
  return true;
}

Back to top page