Cod sursa(job #2357711)
Utilizator | Data | 27 februarie 2019 17:47:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
unsigned int N, count_prime;
bool sieve[2000000];
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int main()
{
cin>>N;
cin.close();
for(unsigned int i = 2; i <= N; i++)
{
if(sieve[i] == false)
{
for(unsigned int j = i; j <= N; j += i)
sieve[j] = true;
sieve[i] = false;
count_prime++;
}
}
cout<<count_prime;
cout.close();
return 0;
}