//Finding prime numbers
#include <iostream>
using namespace std;
int main()
{
int n; //User input
int num = 1; //number that will be tested if its a prime
int primeCount = 0; //counts the times it num % i == 0
cout<< "Enter how many prime numbers you want.
";
cin>> n; //Number of prime numbers you want
//prints 1 as a prime number
cout<< 1 << 'n';
//counts the number of primes
for(int j = 1; j <= n; j++)
{
num++;//num = 2
primeCount = 0;
//Determines if a number is prime
for(int i = 1; i
<= num; i++)
{
if(num % i ==
0)
{
primeCount++;
}
}
if(primeCount
== 2)
{
cout<< num << 'n';
}
}
return 0;
}
For more information you can get help at CodeAvail- Online Computer Science Assignment
help