Cod sursa(job #1927938)
Utilizator | Data | 15 martie 2017 18:49:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int N,i,j,nr;
bool p[2000002];
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int main()
{
f>>N;
for (i=2;i<=N;i++) p[i]=true;
for (i=2;i*i<=N;i++) {
if (p[i])
for (j=2*i;j<=N;j+=i) p[j]=false;
}
for (i=2;i<=N;i++)
if (p[i]) nr++;
g<<nr;
return 0;
}