can anyone explain this code for checking is prime or not?

前端未结

关注

 0  542

// how this function checks if a number is prime or not

  bool isPrime(ll n){
      if(n == 2LL)
      return 1;
      if(n%2LL == 0LL)
      return 0;
      for(


                      
              相关标签: