C++ Program to find Prime Number

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself.

Example:

#include<iostream>
#include<math.h> //sqrt function used

using namespace std;

int main(){
// Variable Declaration 
int n;

// Get Input Value
 cout<<"Enter the Number : ";
 cin>>n;

cout <<"List Of Prime Numbers Below "<<n<<endl;

//for Loop Block For Find Prime Number 

for (int i=2; i<n; i++)
 for (int j=2; j*j<=i; j++)
 {
    if (i % j == 0)
    break;
    else if (j+1 > sqrt(i)) {
    cout << i << endl;
 }
} 

// Wait For Output Screen
 system("pause");
 return 0;
}

Program Output:

Enter the Number : 50

List Of Prime Numbers Below 50
5
7
11
13
17
19
23
29
31
37
41
43
47