Function(1)_prime

#include<iostream>
using namespace std;

int IsPrime(int n){

    for(int i=2; i<n; i++){
        if (n%i==0)
            return 0;
    }
    return 1;

    }

    int PrimeUptoN(int n){
    for (int i=2;i<=n;i++){
        if (IsPrime(i)==1) cout <<i<< " ";
        }
    }

int main(){
    int n; cin>>n;
    cout << "Numbers are: ";
    PrimeUptoN(n);
}

#include<iostream>
using namespace std;

bool IsPrime(int n){

    for(int i=2; i<n; i++){
        if (n%i==0)
            return false;
        }
    return true;
    }

  int main(){
    int n; cin>>n;
    cout << "Numbers are: ";
    for (int i=2;i<=n;i++){
        if (IsPrime(i)==true) cout <<i<< " ";
        }
 }