Cod sursa(job #737573)
Utilizator | Data | 19 aprilie 2012 18:23:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#define dim 2000002
using namespace std;
char prim[dim];
long long i,j;
long long n;
long long 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;
return 0;
}