C++ Program To Find Number Is Prime Or Not

Problem :- Write A Program To Find Number Is Prime Or Not

Prime Number :- A Number That Can Only Divisible By Itself or 1.
You can see that it's clear a number divisible by itself or one then use a loop start from one like condition=1 and max condition up to <=Number 
and divide a number by condition and increase counter by ++ if number divide after the end if count is equal to 2 then number is prime otherwise not.

Solution :-

#include<iostream>
using namespace std;
int main()
{
    int number,count=0;
    
cout<<"ENTER NUMBER TO CHECK IT IS PRIME OR NOT ";
    cin>>number;
    
for(int a=1;a<=number;a++)
    {
        if(number%a==0)
        {
            count++;
        }
    }
    if(count==2)
    {
        cout<<"\n"<<number<<"IS PRIME NUMBER \n";
    }
    else
    {
        cout<<"\n"<<number<<"IS NOT A PRIME NUMBER \n";
    }
    return 0;

}

Output:-