test_allprimeno.cpp

/*All prime numbers
Send Feedback
Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).
Print the prime numbers in different lines.
Input Format :
Integer N
Output Format :
Prime numbers in different lines
Constraints :
1 <= N <= 100
Sample Input 1:
9
Sample Output 1:
2
3
5
7
Sample Input 2:
20
Sample Output 2:
2
3
5
7
11
13
17
19*/

program:-
  #include <iostream>
using namespace std;

int main() {
	// Write your code here
	int n;
    cin>> n;
    for(int i=2;i<=n;i++)
        {
        int j=1;
        int k =2;
        while(k<i){
            if(i%k == 0){
                j=0;
            }
           k++; 
        }
        if(j==1){
            cout<<i<<endl;
        }
    }       
}