Pagini recente » Cod sursa (job #2820214) | Cod sursa (job #2270858) | Cod sursa (job #2751787) | Cod sursa (job #2181789) | Cod sursa (job #280879)
Cod sursa(job #280879)
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int main()
{
unsigned int totalPrimes = 0;
unsigned long n;
cout << "Enter the limit: ";
cin >> n;
bool isPrime[n+1];
totalPrimes = n - 1; // (1 is not prime)
for(int i = 0; i < n+1; i++) {
isPrime[i] = true;
}
unsigned long i, j;
for (i = 2; i*i <= n; i++) {
if (isPrime[i]) {
j = 2;
while (i*j <= n) {
unsigned long multiple = i*j;
if(isPrime[multiple])
totalPrimes--;
isPrime[multiple] = 0;
j++;
}
}
}
/*
for (i = 2; i <= n; i++) {
if (isPrime[i]) {
cout << i << " ";
}
}
*/
ofstream fout("ciur.out");
fout << totalPrimes;
//cout << endl << totalPrimes;
fout.close();
return 0;
}