1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
| #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
const int MAX = 100;
long primes [MAX] = { 2,3,5 };
long trial = 5;
int count = 3;
int found = 0;
do
{
trial += 2;
found = 0;
for(int i = 0; i < count; i++)
{
found = (trial % *(primes + i)) == 0;
if(found)
break;
}
if (found == 0);
*(primes + count++) = trial;
}while (count < MAX);
for(int i =0; i < MAX; i++)
{
if(i % 5 == 0)
cout << endl;
cout << setw(10) << *(primes + i);
}
cout << endl;
return 0; |
Partager