c++ 判定素数

#include <iostream>
#include<cmath>
#include<algorithm>
using namespace std;

bool isPrime(int num) 
{
    bool result = true;
    for (int i = 2; i < ceil(1.0*sqrt(num)); i++)
    {
        if (num%i==0)
        {
            result = false;
            break;
        }
        
    }
    return result;
}

int main()
{
    int number;
    bool isprime;
    cin>>number;
    string result;
    isprime = isPrime(number);
    result = isprime ? "is prime" : "not prime";
    cout<<number<<" "<<result<<endl;
    return 0;
}