Cod sursa(job #1512554)
Utilizator | Data | 28 octombrie 2015 11:27:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
const int N = 2000001;
bool c[N];
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int i, j, n,nr;
in>>n;
for (i=2; i*i<N; i++)
{
if (not c[i])
for (j=i*i; j<N; j+=i)
c[j]=true;
}
nr=0;
for (i=2; i<=n; i++)
if (not c[i])
nr++;
out << nr;
return 0;
}