Cod sursa(job #1109595)
Utilizator | Data | 17 februarie 2014 13:26:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#define NMAX 2000000
long a[NMAX];
using namespace std;
int main()
{long i,j,nr=0;
long n;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for (i=2;i<=n;i++) a[i]=1;
for (i=2;i<=n;i++)
if(a[i]==1)
{nr++;
for(j=i+i;j<=n;j=j+i) a[j]=0;
}
g<<nr;
f.close();
g.close();
return 0;
}