primes first n function

t03e3.nprimes.cpp

// t03e3.nprimes.cpp
// juanfc 2024-10-23
// 

#include <iostream>
using namespace std;

int main()
{
    bool isPrime(int n);

    int noPrimes = 100;
    int cnt = 0;
    int trying = 2;
    while (cnt < noPrimes) {
        if (isPrime(trying)) {
            cout << trying << " ";
            ++cnt;
        }
        ++trying;
    }
    cout << endl;
    return 0;
}

bool isPrime(int n)
{
    int i = 2;
    while ( n % i != 0 )
        ++i;
    return i >= n;
}