Cod sursa(job #1121770)
Utilizator | Data | 25 februarie 2014 13:58:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define dim 2000002
using namespace std;
char prim[dim];
long long i,j,n,nrprime;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1) { nrprime++;
for(j=i*i;j<=n;j=j+i)
prim[j]=0;
}
g<<nrprime;
f.close();g.close();
return 0;
}