c++类--素数

#include<bits/stdc++.h>using namespace std;class Prime{    int low;    int high;public :    Prime(int ,int );    bool isPrime(int);    void getPrime();};Prime::Prime(int low,int high){    this->low = low;    this->high = high;}bool Prime::isPrime(int n){    for(int i = 2;i<n;i++)    {        if(n%i==0)            return false;    }    return true;}void Prime::getPrime(){    cout<<"从"<<low<<"到"<<high<<"的素数有:"<<endl;    for(int i = low;i<=high;i++)    {        if(i<2)            continue;        if(isPrime(i))        {            cout<<i<<" ";        }    }    cout<<endl;}int main(){    Prime PP(1,1000);    PP.getPrime();    return 0;}