判断一个正整数是不是素数（C++）

#include <iostream>

using namespace std;

int main()

{

  int num;

  do

  {

    cout<<"Enter an integer"<<endl;

    cin>>num;

   }while(num<=0);

   int count=0;

   int i=num;

   while(i>=1)

   {

       if(num%i==0)

          {

               ++count;

          }

          --i;

    }

     if(count==2)

      {

         cout<<"It is a prime number."<<endl;

       }

       else cout<<"It is not a prime number."<<endl;

}